GCD of 145, 751, 60 Calculator

Given Input numbers are 145, 751, 60

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

Divisors of 145

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

1, 5, 29, 145

Divisors of 751

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

1, 751

Divisors of 60

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

1, 2, 3, 4, 5, 6, 10, 12, 15, 20, 30, 60

Greatest Common Divisior

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

Therefore, GCD of numbers 145, 751, 60 is 1

Given Input Data is 145, 751, 60

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

Prime Factorization of 145 is 5 x 29

Prime Factorization of 751 is 751

Prime Factorization of 60 is 2 x 2 x 3 x 5

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(145, 751) = 108895

GCD(145, 751) = ( 145 x 751 ) / 108895

GCD(145, 751) = 108895 / 108895

GCD(145, 751) = 1

Step2:

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

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

LCM(1, 60) = 60

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

GCD(1, 60) = 60 / 60

GCD(1, 60) = 1

GCD of 145, 751, 60 is 1

Here are some samples of GCD of Numbers calculations.

• GCD of 763, 259, 51
• GCD of 981, 742, 50
• GCD of 604, 190, 66
• GCD of 774, 682, 51
• GCD of 640, 781, 72

1. What is the GCD of 145, 751, 60?

GCD of 145, 751, 60 is 1

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

You can find a detailed procedure to find GCD of 145, 751, 60 on our page.

3. How to find GCD of 145, 751, 60 on a calculator?

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