GCD of 204, 145, 73 Calculator

Given Input numbers are 204, 145, 73

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

Divisors of 204

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

1, 2, 3, 4, 6, 12, 17, 34, 51, 68, 102, 204

Divisors of 145

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

1, 5, 29, 145

Divisors of 73

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

1, 73

Greatest Common Divisior

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

Therefore, GCD of numbers 204, 145, 73 is 1

Given Input Data is 204, 145, 73

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

Prime Factorization of 204 is 2 x 2 x 3 x 17

Prime Factorization of 145 is 5 x 29

Prime Factorization of 73 is 73

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(204, 145) = 29580

GCD(204, 145) = ( 204 x 145 ) / 29580

GCD(204, 145) = 29580 / 29580

GCD(204, 145) = 1

Step2:

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

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

LCM(1, 73) = 73

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

GCD(1, 73) = 73 / 73

GCD(1, 73) = 1

GCD of 204, 145, 73 is 1

Here are some samples of GCD of Numbers calculations.

• GCD of 758, 876, 54
• GCD of 673, 217, 73
• GCD of 207, 392, 92
• GCD of 731, 536, 57
• GCD of 498, 125, 91

1. What is the GCD of 204, 145, 73?

GCD of 204, 145, 73 is 1

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

You can find a detailed procedure to find GCD of 204, 145, 73 on our page.

3. How to find GCD of 204, 145, 73 on a calculator?

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