GCD of 984, 146, 330, 946 Calculator

Given Input numbers are 984, 146, 330, 946

In the factoring method, we have to find the divisors of all numbers

Divisors of 984 :

The positive integer divisors of 984 that completely divides 984 are.

1, 2, 3, 4, 6, 8, 12, 24, 41, 82, 123, 164, 246, 328, 492, 984

Divisors of 146 :

The positive integer divisors of 146 that completely divides 146 are.

1, 2, 73, 146

Divisors of 330 :

The positive integer divisors of 330 that completely divides 330 are.

1, 2, 3, 5, 6, 10, 11, 15, 22, 30, 33, 55, 66, 110, 165, 330

Divisors of 946 :

The positive integer divisors of 946 that completely divides 946 are.

1, 2, 11, 22, 43, 86, 473, 946

GCD of numbers is the greatest common divisor

So, the GCD (984, 146, 330, 946) = 2.

Given numbers are 984, 146, 330, 946

The list of prime factors of all numbers are

Prime factors of 984 are 2 x 2 x 2 x 3 x 41

Prime factors of 146 are 2 x 73

Prime factors of 330 are 2 x 3 x 5 x 11

Prime factors of 946 are 2 x 11 x 43

The highest common occurrence is 2¹

Therefore, GCD of 984, 146, 330, 946 is 2.

Given numbers are 984, 146, 330, 946

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

Apply this formula for all numbers.

Step1:

LCM(984, 146) = 71832

GCD(984, 146) = ( 984 x 146 ) / 71832

= 984 / 146

= 984

Step2:

LCM(2, 330) = 330

GCD(2, 330) = ( 2 x 330 ) / 330

= 2 / 330

= 2

Step3:

LCM(2, 946) = 946

GCD(2, 946) = ( 2 x 946 ) / 946

= 2 / 946

= 2

So, Greatest Common Divisor of 984, 146, 330, 946 is 2

Here are some samples of GCD of Numbers calculations.

• GCD of 835, 852, 296, 595
• GCD of 957, 221, 226, 786
• GCD of 302, 925, 668, 213
• GCD of 911, 917, 507, 620
• GCD of 990, 688, 153, 647

Given numbers are 984, 146, 330, 946
The greatest common divisor of numbers 984, 146, 330, 946 can be found in various methods such as the LCM formula, factoring, and prime factorization. The GCD of numbers 984, 146, 330, 946 is 2.

1. What is the GCD of 984, 146, 330, 946?

GCD of given numbers 984, 146, 330, 946 is 2

2. How to calculate the greatest common divisor of 984, 146, 330, 946?

We can find the highest common divisor of 984, 146, 330, 946 easily using the prime factorization method. Just list the prime factors of all numbers and pick the highest common factor which is the GCD of 984, 146, 330, 946 i.e 2.

3. How can I use the GCD of 984, 146, 330, 946Calculator?

Out the numbers 984, 146, 330, 946 into the GCD calculator and hit the calculate button to get the greatest common divisor as result.