GCD of 948, 972, 391, 847 Calculator

Given Input numbers are 948, 972, 391, 847

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

Divisors of 948 :

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

1, 2, 3, 4, 6, 12, 79, 158, 237, 316, 474, 948

Divisors of 972 :

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

1, 2, 3, 4, 6, 9, 12, 18, 27, 36, 54, 81, 108, 162, 243, 324, 486, 972

Divisors of 391 :

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

1, 17, 23, 391

Divisors of 847 :

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

1, 7, 11, 77, 121, 847

GCD of numbers is the greatest common divisor

So, the GCD (948, 972, 391, 847) = 1.

Given numbers are 948, 972, 391, 847

The list of prime factors of all numbers are

Prime factors of 948 are 2 x 2 x 3 x 79

Prime factors of 972 are 2 x 2 x 3 x 3 x 3 x 3 x 3

Prime factors of 391 are 17 x 23

Prime factors of 847 are 7 x 11 x 11

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

Given numbers are 948, 972, 391, 847

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

Apply this formula for all numbers.

Step1:

LCM(948, 972) = 76788

GCD(948, 972) = ( 948 x 972 ) / 76788

= 948 / 972

= 948

Step2:

LCM(12, 391) = 4692

GCD(12, 391) = ( 12 x 391 ) / 4692

= 12 / 391

= 12

Step3:

LCM(1, 847) = 847

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

= 1 / 847

= 1

So, Greatest Common Divisor of 948, 972, 391, 847 is 1

Here are some samples of GCD of Numbers calculations.

• GCD of 545, 549, 333, 192
• GCD of 891, 238, 708, 279
• GCD of 123, 697, 826, 568
• GCD of 327, 527, 314, 624
• GCD of 271, 175, 770, 248

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

1. What is the GCD of 948, 972, 391, 847?

GCD of given numbers 948, 972, 391, 847 is 1

2. How to calculate the greatest common divisor of 948, 972, 391, 847?

We can find the highest common divisor of 948, 972, 391, 847 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 948, 972, 391, 847 i.e 1.

3. How can I use the GCD of 948, 972, 391, 847Calculator?

Out the numbers 948, 972, 391, 847 into the GCD calculator and hit the calculate button to get the greatest common divisor as result.