GCD of 146, 687, 887 Calculator

Given Input numbers are 146, 687, 887

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

Divisors of 146

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

1, 2, 73, 146

Divisors of 687

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

1, 3, 229, 687

Divisors of 887

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

1, 887

Greatest Common Divisior

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

Therefore, GCD of numbers 146, 687, 887 is 1

Given Input Data is 146, 687, 887

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

Prime Factorization of 146 is 2 x 73

Prime Factorization of 687 is 3 x 229

Prime Factorization of 887 is 887

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(146, 687) = 100302

GCD(146, 687) = ( 146 x 687 ) / 100302

GCD(146, 687) = 100302 / 100302

GCD(146, 687) = 1

Step2:

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

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

LCM(1, 887) = 887

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

GCD(1, 887) = 887 / 887

GCD(1, 887) = 1

GCD of 146, 687, 887 is 1

Here are some samples of GCD of Numbers calculations.

• GCD of 554, 732, 737
• GCD of 171, 507, 261
• GCD of 597, 515, 322
• GCD of 148, 743, 394
• GCD of 548, 429, 933

1. What is the GCD of 146, 687, 887?

GCD of 146, 687, 887 is 1

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

You can find a detailed procedure to find GCD of 146, 687, 887 on our page.

3. How to find GCD of 146, 687, 887 on a calculator?

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