GCD of 958, 666, 732, 330 Calculator

Given Input numbers are 958, 666, 732, 330

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

Divisors of 958 :

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

1, 2, 479, 958

Divisors of 666 :

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

1, 2, 3, 6, 9, 18, 37, 74, 111, 222, 333, 666

Divisors of 732 :

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

1, 2, 3, 4, 6, 12, 61, 122, 183, 244, 366, 732

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

GCD of numbers is the greatest common divisor

So, the GCD (958, 666, 732, 330) = 2.

Given numbers are 958, 666, 732, 330

The list of prime factors of all numbers are

Prime factors of 958 are 2 x 479

Prime factors of 666 are 2 x 3 x 3 x 37

Prime factors of 732 are 2 x 2 x 3 x 61

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

The highest common occurrence is 2¹

Therefore, GCD of 958, 666, 732, 330 is 2.

Given numbers are 958, 666, 732, 330

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

Apply this formula for all numbers.

Step1:

LCM(958, 666) = 319014

GCD(958, 666) = ( 958 x 666 ) / 319014

= 958 / 666

= 958

Step2:

LCM(2, 732) = 732

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

= 2 / 732

= 2

Step3:

LCM(2, 330) = 330

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

= 2 / 330

= 2

So, Greatest Common Divisor of 958, 666, 732, 330 is 2

Here are some samples of GCD of Numbers calculations.

• GCD of 454, 477, 768, 949
• GCD of 401, 451, 203, 256
• GCD of 605, 881, 354, 294
• GCD of 149, 407, 828, 869
• GCD of 965, 663, 422, 308

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

1. What is the GCD of 958, 666, 732, 330?

GCD of given numbers 958, 666, 732, 330 is 2

2. How to calculate the greatest common divisor of 958, 666, 732, 330?

We can find the highest common divisor of 958, 666, 732, 330 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 958, 666, 732, 330 i.e 2.

3. How can I use the GCD of 958, 666, 732, 330Calculator?

Out the numbers 958, 666, 732, 330 into the GCD calculator and hit the calculate button to get the greatest common divisor as result.