Greatest Common Divisor (GCD) of 16, 30 and 97

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

GCD(16,30,97)

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

Divisors of 16:
1, 2, 4, 8, and 16.

Divisors of 30:
1, 2, 3, 5, 6, 10, 15, and 30.

Divisors of 97:
1 and 97.

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 16, 30 and 97 is:

GCD(16,30,97) = 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 16, 30 and 98
Go here for the next set of numbers that we calculated the Greatest Common Divisor for.