GCD Calculator

Find the greatest common divisor — also called the highest common factor (HCF) — of two or more whole numbers.

What is the GCD Calculator?

The GCD is the largest whole number that divides every number in the set without a remainder.

How does it work?

The Euclidean algorithm repeatedly replaces the larger number with the remainder of dividing it by the smaller, until the remainder is zero. It extends to many numbers pair by pair.

Formula

gcd(a, b) = gcd(b, a mod b); gcd(a, 0) = a

Example

GCD of 48, 180 and 600 is 12.

Frequently asked questions

How is GCD related to LCM?

For two numbers, GCD × LCM = the product of the numbers.

Related tools

Enable JavaScript to use this calculator.