GCD of 665, 467, 389 Calculator

Given Input numbers are 665, 467, 389

To find the GCD of numbers using factoring list out all the divisors of each number

Divisors of 665

List of positive integer divisors of 665 that divides 665 without a remainder.

1, 5, 7, 19, 35, 95, 133, 665

Divisors of 467

List of positive integer divisors of 467 that divides 467 without a remainder.

1, 467

Divisors of 389

List of positive integer divisors of 389 that divides 389 without a remainder.

1, 389

Greatest Common Divisior

We found the divisors of 665, 467, 389 . The biggest common divisior number is the GCD number.
So the Greatest Common Divisior 665, 467, 389 is 1.

Therefore, GCD of numbers 665, 467, 389 is 1

Given Input Data is 665, 467, 389

Make a list of Prime Factors of all the given numbers initially

Prime Factorization of 665 is 5 x 7 x 19

Prime Factorization of 467 is 467

Prime Factorization of 389 is 389

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

Step1:

Let's calculate the GCD of first two numbers

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

LCM(665, 467) = 310555

GCD(665, 467) = ( 665 x 467 ) / 310555

GCD(665, 467) = 310555 / 310555

GCD(665, 467) = 1

Step2:

Here we consider the GCD from the above i.e. 1 as first number and the next as 389

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

LCM(1, 389) = 389

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

GCD(1, 389) = 389 / 389

GCD(1, 389) = 1

GCD of 665, 467, 389 is 1

Here are some samples of GCD of Numbers calculations.

• GCD of 211, 405, 894
• GCD of 532, 583, 794
• GCD of 699, 861, 838
• GCD of 629, 445, 707
• GCD of 503, 286, 454

1. What is the GCD of 665, 467, 389?

GCD of 665, 467, 389 is 1

2. Where do I get the detailed procedure to find GCD of 665, 467, 389?

You can find a detailed procedure to find GCD of 665, 467, 389 on our page.

3. How to find GCD of 665, 467, 389 on a calculator?

You can find the GCD of 665, 467, 389 by simply giving the inputs separated by commas and click on the calculate button to avail the Greatest Common Divisor in less time.