GCD of 387, 145, 66 Calculator

Given Input numbers are 387, 145, 66

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

Divisors of 387

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

1, 3, 9, 43, 129, 387

Divisors of 145

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

1, 5, 29, 145

Divisors of 66

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

1, 2, 3, 6, 11, 22, 33, 66

Greatest Common Divisior

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

Therefore, GCD of numbers 387, 145, 66 is 1

Given Input Data is 387, 145, 66

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

Prime Factorization of 387 is 3 x 3 x 43

Prime Factorization of 145 is 5 x 29

Prime Factorization of 66 is 2 x 3 x 11

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(387, 145) = 56115

GCD(387, 145) = ( 387 x 145 ) / 56115

GCD(387, 145) = 56115 / 56115

GCD(387, 145) = 1

Step2:

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

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

LCM(1, 66) = 66

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

GCD(1, 66) = 66 / 66

GCD(1, 66) = 1

GCD of 387, 145, 66 is 1

Here are some samples of GCD of Numbers calculations.

• GCD of 716, 409, 10
• GCD of 102, 908, 85
• GCD of 358, 761, 61
• GCD of 996, 578, 32
• GCD of 963, 756, 89

1. What is the GCD of 387, 145, 66?

GCD of 387, 145, 66 is 1

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

You can find a detailed procedure to find GCD of 387, 145, 66 on our page.

3. How to find GCD of 387, 145, 66 on a calculator?

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