GCD Calculator
Find the Greatest Common Divisor (HCF) of two or more numbers instantly using the Euclidean algorithm.
Numbers
Add two or more positive integers
Awaiting Inputs
Enter at least two positive integers to calculate the GCD.
The GCD (or HCF) is the largest number that divides every number in your list without a remainder. It's widely used to simplify fractions, solve ratio problems, and find common factors in math and computer science.
GCD and LCM are closely related: for two numbers, LCM(a, b) × GCD(a, b) = a × b. For example, GCD(12, 18) = 6, so LCM(12, 18) = (12 × 18) ÷ 6 = 36. Need the least common multiple with step-by-step working? Use our LCM Calculator.
Frequently Asked Questions
GCD (Greatest Common Divisor), also called HCF (Highest Common Factor), is the largest positive integer that divides two or more numbers without leaving a remainder.
The Euclidean algorithm repeatedly replaces the larger number with the remainder of dividing it by the smaller number, until the remainder is zero. The last non-zero remainder is the GCD.
The GCD of two distinct prime numbers is always 1, since prime numbers share no common factors other than 1.