Greatest Common Divisor (GCD) of 66 and 11

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

GCD(66,11)

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

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

Divisors of 11:
1 and 11.

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

GCD(66,11) = 11

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 66 and 12
Go here for the next set of numbers that we calculated the Greatest Common Divisor for.