Greatest Common Divisor (GCD) of 6 and 66

The Greatest Common Divisor (GCD) of 6 and 66 is the largest positive integer that divides both 6 and 66. Mathematically, the problem we are solving is:

GCD(6,66)

To solve the problem, we will list all the positive integers (divisors) that can be divided into 6 and 66. We will then compare the lists of divisors to find the greatest divisor they have in common.

Divisors of 6:
1, 2, 3, and 6.

Divisors of 66:
1, 2, 3, 6, 11, 22, 33, and 66.

When we compare the lists of divisors above, we see that the largest number they have in common is 6. Thus, the Greatest Common Divisor (GCD) of 6 and 66 is:

GCD(6,66) = 6

Greatest Common Divisor Calculator
Please enter another two or three numbers below so we can calculate the Greatest Common Divisor (GCD) for you:

Greatest Common Divisor (GCD) of 6 and 67
Go here for the next set of numbers that we calculated the Greatest Common Divisor for.