Greatest Common Divisor (GCD) of 2, 3 and 62

The Greatest Common Divisor (GCD) of 2, 3 and 62 is the largest positive integer that equally divides all three numbers: 2, 3 and 62. Mathematically, the problem we are solving is:

GCD(2,3,62)

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

Divisors of 2:
1 and 2.

Divisors of 3:
1 and 3.

Divisors of 62:
1, 2, 31, and 62.

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 2, 3 and 62 is:

GCD(2,3,62) = 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 2, 3 and 63
Go here for the next set of numbers that we calculated the Greatest Common Divisor for.