GCD & LCM Calculator

Greatest common divisor and least common multiple of any numbers. Find the GCD (HCF) and LCM of two or more numbers instantly. Step-count shown via the Euclidean algorithm. Free online GCD and LCM calculator.

This tool runs 100% in your browser. Your input is never sent to any server — you can even go offline after the page loads.

About the GCD & LCM Calculator

The greatest common divisor (or highest common factor) is the largest number dividing all your inputs exactly; the least common multiple is the smallest number they all divide into. These two values power fraction simplification, gear-ratio problems and scheduling cycles — "when do two blinking lights sync?". Enter two or more integers and this calculator returns both results with the count of Euclidean algorithm steps used to find them.

How to use the GCD & LCM Calculator

  1. Enter your numbers separated by commas.
  2. Results appear instantly.
  3. Use the GCD to simplify fractions.
  4. Use the LCM to combine denominators or cycles.

Key features

What is the Euclidean algorithm?
A 2,300-year-old method: repeatedly replace the larger number by the remainder of dividing it by the smaller, until the remainder is zero. The last non-zero value is the GCD.
How are GCD and LCM related?
For two numbers, GCD × LCM equals the product of the numbers — a quick way to find the LCM once you know the GCD.

Related Math Calculators tools

More utilities from the same category.

View all →