GCD of 687, 145, 212 Calculator

Given Input numbers are 687, 145, 212

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

Divisors of 687

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

1, 3, 229, 687

Divisors of 145

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

1, 5, 29, 145

Divisors of 212

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

1, 2, 4, 53, 106, 212

Greatest Common Divisior

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

Therefore, GCD of numbers 687, 145, 212 is 1

Given Input Data is 687, 145, 212

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

Prime Factorization of 687 is 3 x 229

Prime Factorization of 145 is 5 x 29

Prime Factorization of 212 is 2 x 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(687, 145) = 99615

GCD(687, 145) = ( 687 x 145 ) / 99615

GCD(687, 145) = 99615 / 99615

GCD(687, 145) = 1

Step2:

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

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

LCM(1, 212) = 212

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

GCD(1, 212) = 212 / 212

GCD(1, 212) = 1

GCD of 687, 145, 212 is 1

Here are some samples of GCD of Numbers calculations.

• GCD of 208, 711, 367
• GCD of 394, 784, 576
• GCD of 661, 448, 595
• GCD of 779, 622, 451
• GCD of 634, 231, 152

1. What is the GCD of 687, 145, 212?

GCD of 687, 145, 212 is 1

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

You can find a detailed procedure to find GCD of 687, 145, 212 on our page.

3. How to find GCD of 687, 145, 212 on a calculator?

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