GCD of 138, 656, 330, 915 Calculator

Given Input numbers are 138, 656, 330, 915

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

Divisors of 138 :

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

1, 2, 3, 6, 23, 46, 69, 138

Divisors of 656 :

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

1, 2, 4, 8, 16, 41, 82, 164, 328, 656

Divisors of 330 :

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

1, 2, 3, 5, 6, 10, 11, 15, 22, 30, 33, 55, 66, 110, 165, 330

Divisors of 915 :

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

1, 3, 5, 15, 61, 183, 305, 915

GCD of numbers is the greatest common divisor

So, the GCD (138, 656, 330, 915) = 1.

Given numbers are 138, 656, 330, 915

The list of prime factors of all numbers are

Prime factors of 138 are 2 x 3 x 23

Prime factors of 656 are 2 x 2 x 2 x 2 x 41

Prime factors of 330 are 2 x 3 x 5 x 11

Prime factors of 915 are 3 x 5 x 61

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

Given numbers are 138, 656, 330, 915

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

Apply this formula for all numbers.

Step1:

LCM(138, 656) = 45264

GCD(138, 656) = ( 138 x 656 ) / 45264

= 138 / 656

= 138

Step2:

LCM(2, 330) = 330

GCD(2, 330) = ( 2 x 330 ) / 330

= 2 / 330

= 2

Step3:

LCM(2, 915) = 1830

GCD(2, 915) = ( 2 x 915 ) / 1830

= 2 / 915

= 2

So, Greatest Common Divisor of 138, 656, 330, 915 is 1

Here are some samples of GCD of Numbers calculations.

• GCD of 919, 613, 110, 290
• GCD of 609, 158, 397, 167
• GCD of 584, 437, 381, 159
• GCD of 869, 281, 894, 768
• GCD of 160, 500, 141, 661

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

1. What is the GCD of 138, 656, 330, 915?

GCD of given numbers 138, 656, 330, 915 is 1

2. How to calculate the greatest common divisor of 138, 656, 330, 915?

We can find the highest common divisor of 138, 656, 330, 915 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 138, 656, 330, 915 i.e 1.

3. How can I use the GCD of 138, 656, 330, 915Calculator?

Out the numbers 138, 656, 330, 915 into the GCD calculator and hit the calculate button to get the greatest common divisor as result.