GCD of 118, 287, 394 Calculator

Given Input numbers are 118, 287, 394

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 287

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

1, 7, 41, 287

Divisors of 394

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

1, 2, 197, 394

Greatest Common Divisior

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

Therefore, GCD of numbers 118, 287, 394 is 1

Given Input Data is 118, 287, 394

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

Prime Factorization of 118 is 2 x 59

Prime Factorization of 287 is 7 x 41

Prime Factorization of 394 is 2 x 197

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, 287) = 33866

GCD(118, 287) = ( 118 x 287 ) / 33866

GCD(118, 287) = 33866 / 33866

GCD(118, 287) = 1

Step2:

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

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

LCM(1, 394) = 394

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

GCD(1, 394) = 394 / 394

GCD(1, 394) = 1

GCD of 118, 287, 394 is 1

Here are some samples of GCD of Numbers calculations.

• GCD of 981, 828, 145
• GCD of 392, 280, 707
• GCD of 296, 748, 129
• GCD of 673, 703, 629
• GCD of 530, 921, 600

1. What is the GCD of 118, 287, 394?

GCD of 118, 287, 394 is 1

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

You can find a detailed procedure to find GCD of 118, 287, 394 on our page.

3. How to find GCD of 118, 287, 394 on a calculator?

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