GCD of 397, 558, 851 Calculator

Given Input numbers are 397, 558, 851

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

Divisors of 397 :

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

1, 397

Divisors of 558 :

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

1, 2, 3, 6, 9, 18, 31, 62, 93, 186, 279, 558

Divisors of 851 :

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

1, 23, 37, 851

GCD of numbers is the greatest common divisor

So, the GCD (397, 558, 851) = 1.

Given numbers are 397, 558, 851

The list of prime factors of all numbers are

Prime factors of 397 are 397

Prime factors of 558 are 2 x 3 x 3 x 31

Prime factors of 851 are 23 x 37

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

Given numbers are 397, 558, 851

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

Apply this formula for all numbers.

Step1:

LCM(397, 558) = 221526

GCD(397, 558) = ( 397 x 558 ) / 221526

= 397 / 558

= 397

Step2:

LCM(1, 851) = 851

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

= 1 / 851

= 1

So, Greatest Common Divisor of 397, 558, 851 is 1

Here are some samples of GCD of Numbers calculations.

• GCD of 876, 581, 491
• GCD of 300, 823, 866
• GCD of 567, 982, 356
• GCD of 721, 897, 430
• GCD of 352, 787, 685

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

1. What is the GCD of 397, 558, 851?

GCD of given numbers 397, 558, 851 is 1

2. How to calculate the greatest common divisor of 397, 558, 851?

We can find the highest common divisor of 397, 558, 851 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 397, 558, 851 i.e 1.

3. How can I use the GCD of 397, 558, 851Calculator?

Out the numbers 397, 558, 851 into the GCD calculator and hit the calculate button to get the greatest common divisor as result.