GCD of 148, 661, 938 Calculator

Given Input numbers are 148, 661, 938

In the factoring method, we have to find the divisors of all numbers

Divisors of 148 :

The positive integer divisors of 148 that completely divides 148 are.

1, 2, 4, 37, 74, 148

Divisors of 661 :

The positive integer divisors of 661 that completely divides 661 are.

1, 661

Divisors of 938 :

The positive integer divisors of 938 that completely divides 938 are.

1, 2, 7, 14, 67, 134, 469, 938

GCD of numbers is the greatest common divisor

So, the GCD (148, 661, 938) = 1.

Given numbers are 148, 661, 938

The list of prime factors of all numbers are

Prime factors of 148 are 2 x 2 x 37

Prime factors of 661 are 661

Prime factors of 938 are 2 x 7 x 67

The above numbers do not have any common prime factor. So GCD is 1

Given numbers are 148, 661, 938

GCD of 2 numbers formula is GCD(a, b) = ( a x b) / LCM(a, b)

Apply this formula for all numbers.

Step1:

LCM(148, 661) = 97828

GCD(148, 661) = ( 148 x 661 ) / 97828

= 148 / 661

= 148

Step2:

LCM(1, 938) = 938

GCD(1, 938) = ( 1 x 938 ) / 938

= 1 / 938

= 1

So, Greatest Common Divisor of 148, 661, 938 is 1

Here are some samples of GCD of Numbers calculations.

• GCD of 678, 307, 874
• GCD of 349, 914, 364
• GCD of 130, 565, 314
• GCD of 831, 216, 339
• GCD of 567, 457, 368

Given numbers are 148, 661, 938
The greatest common divisor of numbers 148, 661, 938 can be found in various methods such as the LCM formula, factoring, and prime factorization. The GCD of numbers 148, 661, 938 is 1.

1. What is the GCD of 148, 661, 938?

GCD of given numbers 148, 661, 938 is 1

2. How to calculate the greatest common divisor of 148, 661, 938?

We can find the highest common divisor of 148, 661, 938 easily using the prime factorization method. Just list the prime factors of all numbers and pick the highest common factor which is the GCD of 148, 661, 938 i.e 1.

3. How can I use the GCD of 148, 661, 938Calculator?

Out the numbers 148, 661, 938 into the GCD calculator and hit the calculate button to get the greatest common divisor as result.