GCD of 689, 157, 106 Calculator

Given Input numbers are 689, 157, 106

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

Divisors of 689

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

1, 13, 53, 689

Divisors of 157

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

1, 157

Divisors of 106

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

1, 2, 53, 106

Greatest Common Divisior

We found the divisors of 689, 157, 106 . The biggest common divisior number is the GCD number.
So the Greatest Common Divisior 689, 157, 106 is 1.

Therefore, GCD of numbers 689, 157, 106 is 1

Given Input Data is 689, 157, 106

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

Prime Factorization of 689 is 13 x 53

Prime Factorization of 157 is 157

Prime Factorization of 106 is 2 x 53

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(689, 157) = 108173

GCD(689, 157) = ( 689 x 157 ) / 108173

GCD(689, 157) = 108173 / 108173

GCD(689, 157) = 1

Step2:

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

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

LCM(1, 106) = 106

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

GCD(1, 106) = 106 / 106

GCD(1, 106) = 1

GCD of 689, 157, 106 is 1

Here are some samples of GCD of Numbers calculations.

• GCD of 972, 147, 105
• GCD of 259, 315, 886
• GCD of 631, 789, 988
• GCD of 634, 769, 538
• GCD of 308, 744, 546

1. What is the GCD of 689, 157, 106?

GCD of 689, 157, 106 is 1

2. Where do I get the detailed procedure to find GCD of 689, 157, 106?

You can find a detailed procedure to find GCD of 689, 157, 106 on our page.

3. How to find GCD of 689, 157, 106 on a calculator?

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