UtilSlateSearch toolsCtrl K

LCM and GCD Calculator

Find the GCD and LCM of two or more numbers.

Two or more, separated by commas or spaces.

Result

Greatest common divisor (GCD)

6

Least common multiple (LCM)
180
Show stepsHide steps
  1. 12 = 2^2 × 3
  2. 18 = 2 × 3^2
  3. 30 = 2 × 3 × 5
  4. GCD: the primes every number shares, at their lowest power. LCM: every prime, at its highest power.

Runs on your device.

Questions

What are the GCD and LCM?

The greatest common divisor is the largest number that divides them all; the least common multiple is the smallest number they all divide. For 12 and 18: GCD 6, LCM 36.

How does Euclid’s algorithm work?

Divide the larger number by the smaller and keep the remainder; repeat with the smaller number and the remainder until the remainder is 0. The last divisor is the GCD.

What is GCF?

Greatest common factor, another name for the GCD, as is highest common factor (HCF).

Is it free? Do I need an account?

It is free to use and there is nothing to sign up for. There are no watermarks and no daily limits.

Missing something, or not working as it should? Tell us