Greatest Common Divisor (GCD) of 36 and 13

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

GCD(36,13)

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

Divisors of 36:
1, 2, 3, 4, 6, 9, 12, 18, and 36.

Divisors of 13:
1 and 13.

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

GCD(36,13) = 1

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