GCD of 386, 997, 669 Calculator

Given Input numbers are 386, 997, 669

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

Divisors of 386

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

1, 2, 193, 386

Divisors of 997

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

1, 997

Divisors of 669

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

1, 3, 223, 669

Greatest Common Divisior

We found the divisors of 386, 997, 669 . The biggest common divisior number is the GCD number.
So the Greatest Common Divisior 386, 997, 669 is 1.

Therefore, GCD of numbers 386, 997, 669 is 1

Given Input Data is 386, 997, 669

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

Prime Factorization of 386 is 2 x 193

Prime Factorization of 997 is 997

Prime Factorization of 669 is 3 x 223

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(386, 997) = 384842

GCD(386, 997) = ( 386 x 997 ) / 384842

GCD(386, 997) = 384842 / 384842

GCD(386, 997) = 1

Step2:

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

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

LCM(1, 669) = 669

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

GCD(1, 669) = 669 / 669

GCD(1, 669) = 1

GCD of 386, 997, 669 is 1

Here are some samples of GCD of Numbers calculations.

• GCD of 667, 799, 299
• GCD of 396, 287, 162
• GCD of 195, 400, 700
• GCD of 198, 361, 705
• GCD of 473, 572, 826

1. What is the GCD of 386, 997, 669?

GCD of 386, 997, 669 is 1

2. Where do I get the detailed procedure to find GCD of 386, 997, 669?

You can find a detailed procedure to find GCD of 386, 997, 669 on our page.

3. How to find GCD of 386, 997, 669 on a calculator?

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