GCD of 101, 686, 145 Calculator

Given Input numbers are 101, 686, 145

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

Divisors of 101

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

1, 101

Divisors of 686

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

1, 2, 7, 14, 49, 98, 343, 686

Divisors of 145

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

1, 5, 29, 145

Greatest Common Divisior

We found the divisors of 101, 686, 145 . The biggest common divisior number is the GCD number.
So the Greatest Common Divisior 101, 686, 145 is 1.

Therefore, GCD of numbers 101, 686, 145 is 1

Given Input Data is 101, 686, 145

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

Prime Factorization of 101 is 101

Prime Factorization of 686 is 2 x 7 x 7 x 7

Prime Factorization of 145 is 5 x 29

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(101, 686) = 69286

GCD(101, 686) = ( 101 x 686 ) / 69286

GCD(101, 686) = 69286 / 69286

GCD(101, 686) = 1

Step2:

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

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

LCM(1, 145) = 145

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

GCD(1, 145) = 145 / 145

GCD(1, 145) = 1

GCD of 101, 686, 145 is 1

Here are some samples of GCD of Numbers calculations.

• GCD of 388, 896, 515
• GCD of 916, 522, 297
• GCD of 568, 981, 570
• GCD of 742, 472, 140
• GCD of 156, 887, 691

1. What is the GCD of 101, 686, 145?

GCD of 101, 686, 145 is 1

2. Where do I get the detailed procedure to find GCD of 101, 686, 145?

You can find a detailed procedure to find GCD of 101, 686, 145 on our page.

3. How to find GCD of 101, 686, 145 on a calculator?

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