GCD of 929, 217, 145 Calculator

Given Input numbers are 929, 217, 145

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

Divisors of 929

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

1, 929

Divisors of 217

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

1, 7, 31, 217

Divisors of 145

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

1, 5, 29, 145

Greatest Common Divisior

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

Therefore, GCD of numbers 929, 217, 145 is 1

Given Input Data is 929, 217, 145

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

Prime Factorization of 929 is 929

Prime Factorization of 217 is 7 x 31

Prime Factorization of 145 is 5 x 29

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(929, 217) = 201593

GCD(929, 217) = ( 929 x 217 ) / 201593

GCD(929, 217) = 201593 / 201593

GCD(929, 217) = 1

Step2:

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

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

LCM(1, 145) = 145

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

GCD(1, 145) = 145 / 145

GCD(1, 145) = 1

GCD of 929, 217, 145 is 1

Here are some samples of GCD of Numbers calculations.

• GCD of 977, 402, 940
• GCD of 800, 742, 549
• GCD of 255, 677, 192
• GCD of 140, 534, 118
• GCD of 187, 967, 626

1. What is the GCD of 929, 217, 145?

GCD of 929, 217, 145 is 1

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

You can find a detailed procedure to find GCD of 929, 217, 145 on our page.

3. How to find GCD of 929, 217, 145 on a calculator?

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