GCD of 146, 309, 964 Calculator

Given Input numbers are 146, 309, 964

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

Divisors of 146

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

1, 2, 73, 146

Divisors of 309

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

1, 3, 103, 309

Divisors of 964

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

1, 2, 4, 241, 482, 964

Greatest Common Divisior

We found the divisors of 146, 309, 964 . The biggest common divisior number is the GCD number.
So the Greatest Common Divisior 146, 309, 964 is 1.

Therefore, GCD of numbers 146, 309, 964 is 1

Given Input Data is 146, 309, 964

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

Prime Factorization of 146 is 2 x 73

Prime Factorization of 309 is 3 x 103

Prime Factorization of 964 is 2 x 2 x 241

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(146, 309) = 45114

GCD(146, 309) = ( 146 x 309 ) / 45114

GCD(146, 309) = 45114 / 45114

GCD(146, 309) = 1

Step2:

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

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

LCM(1, 964) = 964

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

GCD(1, 964) = 964 / 964

GCD(1, 964) = 1

GCD of 146, 309, 964 is 1

Here are some samples of GCD of Numbers calculations.

• GCD of 306, 112, 363
• GCD of 974, 408, 212
• GCD of 118, 349, 265
• GCD of 820, 420, 448
• GCD of 754, 606, 539

1. What is the GCD of 146, 309, 964?

GCD of 146, 309, 964 is 1

2. Where do I get the detailed procedure to find GCD of 146, 309, 964?

You can find a detailed procedure to find GCD of 146, 309, 964 on our page.

3. How to find GCD of 146, 309, 964 on a calculator?

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