GCD of 397, 987, 246 Calculator

Given Input numbers are 397, 987, 246

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 987 :

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

1, 3, 7, 21, 47, 141, 329, 987

Divisors of 246 :

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

1, 2, 3, 6, 41, 82, 123, 246

GCD of numbers is the greatest common divisor

So, the GCD (397, 987, 246) = 1.

Given numbers are 397, 987, 246

The list of prime factors of all numbers are

Prime factors of 397 are 397

Prime factors of 987 are 3 x 7 x 47

Prime factors of 246 are 2 x 3 x 41

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

Given numbers are 397, 987, 246

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

Apply this formula for all numbers.

Step1:

LCM(397, 987) = 391839

GCD(397, 987) = ( 397 x 987 ) / 391839

= 397 / 987

= 397

Step2:

LCM(1, 246) = 246

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

= 1 / 246

= 1

So, Greatest Common Divisor of 397, 987, 246 is 1

Here are some samples of GCD of Numbers calculations.

• GCD of 156, 595, 952
• GCD of 292, 467, 282
• GCD of 512, 763, 601
• GCD of 197, 746, 315
• GCD of 113, 691, 550

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

1. What is the GCD of 397, 987, 246?

GCD of given numbers 397, 987, 246 is 1

2. How to calculate the greatest common divisor of 397, 987, 246?

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

3. How can I use the GCD of 397, 987, 246Calculator?

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