GCD of 139, 171, 145 Calculator

Given Input numbers are 139, 171, 145

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

Divisors of 139

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

1, 139

Divisors of 171

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

1, 3, 9, 19, 57, 171

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 139, 171, 145 . The biggest common divisior number is the GCD number.
So the Greatest Common Divisior 139, 171, 145 is 1.

Therefore, GCD of numbers 139, 171, 145 is 1

Given Input Data is 139, 171, 145

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

Prime Factorization of 139 is 139

Prime Factorization of 171 is 3 x 3 x 19

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(139, 171) = 23769

GCD(139, 171) = ( 139 x 171 ) / 23769

GCD(139, 171) = 23769 / 23769

GCD(139, 171) = 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 139, 171, 145 is 1

Here are some samples of GCD of Numbers calculations.

• GCD of 637, 763, 211
• GCD of 298, 872, 720
• GCD of 623, 756, 848
• GCD of 470, 344, 996
• GCD of 216, 336, 713

1. What is the GCD of 139, 171, 145?

GCD of 139, 171, 145 is 1

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

You can find a detailed procedure to find GCD of 139, 171, 145 on our page.

3. How to find GCD of 139, 171, 145 on a calculator?

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