GCD of 118, 269, 687 Calculator

Given Input numbers are 118, 269, 687

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

Divisors of 118

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

1, 2, 59, 118

Divisors of 269

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

1, 269

Divisors of 687

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

1, 3, 229, 687

Greatest Common Divisior

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

Therefore, GCD of numbers 118, 269, 687 is 1

Given Input Data is 118, 269, 687

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

Prime Factorization of 118 is 2 x 59

Prime Factorization of 269 is 269

Prime Factorization of 687 is 3 x 229

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(118, 269) = 31742

GCD(118, 269) = ( 118 x 269 ) / 31742

GCD(118, 269) = 31742 / 31742

GCD(118, 269) = 1

Step2:

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

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

LCM(1, 687) = 687

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

GCD(1, 687) = 687 / 687

GCD(1, 687) = 1

GCD of 118, 269, 687 is 1

Here are some samples of GCD of Numbers calculations.

• GCD of 318, 354, 994
• GCD of 489, 904, 529
• GCD of 533, 655, 541
• GCD of 379, 265, 499
• GCD of 655, 417, 341

1. What is the GCD of 118, 269, 687?

GCD of 118, 269, 687 is 1

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

You can find a detailed procedure to find GCD of 118, 269, 687 on our page.

3. How to find GCD of 118, 269, 687 on a calculator?

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