GCD of 978, 512, 486, 138 Calculator

Given Input numbers are 978, 512, 486, 138

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

Divisors of 978 :

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

1, 2, 3, 6, 163, 326, 489, 978

Divisors of 512 :

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

1, 2, 4, 8, 16, 32, 64, 128, 256, 512

Divisors of 486 :

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

1, 2, 3, 6, 9, 18, 27, 54, 81, 162, 243, 486

Divisors of 138 :

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

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

GCD of numbers is the greatest common divisor

So, the GCD (978, 512, 486, 138) = 2.

Given numbers are 978, 512, 486, 138

The list of prime factors of all numbers are

Prime factors of 978 are 2 x 3 x 163

Prime factors of 512 are 2 x 2 x 2 x 2 x 2 x 2 x 2 x 2 x 2

Prime factors of 486 are 2 x 3 x 3 x 3 x 3 x 3

Prime factors of 138 are 2 x 3 x 23

The highest common occurrence is 2¹

Therefore, GCD of 978, 512, 486, 138 is 2.

Given numbers are 978, 512, 486, 138

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

Apply this formula for all numbers.

Step1:

LCM(978, 512) = 250368

GCD(978, 512) = ( 978 x 512 ) / 250368

= 978 / 512

= 978

Step2:

LCM(2, 486) = 486

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

= 2 / 486

= 2

Step3:

LCM(2, 138) = 138

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

= 2 / 138

= 2

So, Greatest Common Divisor of 978, 512, 486, 138 is 2

Here are some samples of GCD of Numbers calculations.

• GCD of 315, 464, 270, 620
• GCD of 582, 140, 879, 617
• GCD of 808, 407, 168, 966
• GCD of 714, 769, 883, 363
• GCD of 705, 665, 956, 682

Given numbers are 978, 512, 486, 138
The greatest common divisor of numbers 978, 512, 486, 138 can be found in various methods such as the LCM formula, factoring, and prime factorization. The GCD of numbers 978, 512, 486, 138 is 2.

1. What is the GCD of 978, 512, 486, 138?

GCD of given numbers 978, 512, 486, 138 is 2

2. How to calculate the greatest common divisor of 978, 512, 486, 138?

We can find the highest common divisor of 978, 512, 486, 138 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 978, 512, 486, 138 i.e 2.

3. How can I use the GCD of 978, 512, 486, 138Calculator?

Out the numbers 978, 512, 486, 138 into the GCD calculator and hit the calculate button to get the greatest common divisor as result.