GCD of 397, 164, 165 Calculator

Given Input numbers are 397, 164, 165

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

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

1, 2, 4, 41, 82, 164

Divisors of 165 :

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

1, 3, 5, 11, 15, 33, 55, 165

GCD of numbers is the greatest common divisor

So, the GCD (397, 164, 165) = 1.

Given numbers are 397, 164, 165

The list of prime factors of all numbers are

Prime factors of 397 are 397

Prime factors of 164 are 2 x 2 x 41

Prime factors of 165 are 3 x 5 x 11

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

Given numbers are 397, 164, 165

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

Apply this formula for all numbers.

Step1:

LCM(397, 164) = 65108

GCD(397, 164) = ( 397 x 164 ) / 65108

= 397 / 164

= 397

Step2:

LCM(1, 165) = 165

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

= 1 / 165

= 1

So, Greatest Common Divisor of 397, 164, 165 is 1

Here are some samples of GCD of Numbers calculations.

• GCD of 331, 148, 664
• GCD of 716, 803, 124
• GCD of 257, 161, 792
• GCD of 274, 514, 749
• GCD of 669, 166, 956

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

1. What is the GCD of 397, 164, 165?

GCD of given numbers 397, 164, 165 is 1

2. How to calculate the greatest common divisor of 397, 164, 165?

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

3. How can I use the GCD of 397, 164, 165Calculator?

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