GCD of 847, 531, 72 Calculator

Given Input numbers are 847, 531, 72

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

Divisors of 847 :

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

1, 7, 11, 77, 121, 847

Divisors of 531 :

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

1, 3, 9, 59, 177, 531

Divisors of 72 :

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

1, 2, 3, 4, 6, 8, 9, 12, 18, 24, 36, 72

GCD of numbers is the greatest common divisor

So, the GCD (847, 531, 72) = 1.

Given numbers are 847, 531, 72

The list of prime factors of all numbers are

Prime factors of 847 are 7 x 11 x 11

Prime factors of 531 are 3 x 3 x 59

Prime factors of 72 are 2 x 2 x 2 x 3 x 3

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

Given numbers are 847, 531, 72

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

Apply this formula for all numbers.

Step1:

LCM(847, 531) = 449757

GCD(847, 531) = ( 847 x 531 ) / 449757

= 847 / 531

= 847

Step2:

LCM(1, 72) = 72

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

= 1 / 72

= 1

So, Greatest Common Divisor of 847, 531, 72 is 1

Here are some samples of GCD of Numbers calculations.

• GCD of 837, 982, 81
• GCD of 671, 775, 45
• GCD of 454, 315, 46
• GCD of 963, 748, 64
• GCD of 493, 426, 45

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

1. What is the GCD of 847, 531, 72?

GCD of given numbers 847, 531, 72 is 1

2. How to calculate the greatest common divisor of 847, 531, 72?

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

3. How can I use the GCD of 847, 531, 72Calculator?

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