GCD of 291, 146, 130 Calculator

Given Input numbers are 291, 146, 130

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

Divisors of 291

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

1, 3, 97, 291

Divisors of 146

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

1, 2, 73, 146

Divisors of 130

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

1, 2, 5, 10, 13, 26, 65, 130

Greatest Common Divisior

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

Therefore, GCD of numbers 291, 146, 130 is 1

Given Input Data is 291, 146, 130

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

Prime Factorization of 291 is 3 x 97

Prime Factorization of 146 is 2 x 73

Prime Factorization of 130 is 2 x 5 x 13

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(291, 146) = 42486

GCD(291, 146) = ( 291 x 146 ) / 42486

GCD(291, 146) = 42486 / 42486

GCD(291, 146) = 1

Step2:

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

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

LCM(1, 130) = 130

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

GCD(1, 130) = 130 / 130

GCD(1, 130) = 1

GCD of 291, 146, 130 is 1

Here are some samples of GCD of Numbers calculations.

• GCD of 341, 697, 276
• GCD of 273, 554, 810
• GCD of 170, 208, 554
• GCD of 992, 901, 631
• GCD of 359, 800, 948

1. What is the GCD of 291, 146, 130?

GCD of 291, 146, 130 is 1

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

You can find a detailed procedure to find GCD of 291, 146, 130 on our page.

3. How to find GCD of 291, 146, 130 on a calculator?

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