Least Common Multiple calculator

Find the smallest positive multiple shared by two or more integers.

Least common multiple
360

3 input integers.

Breakdown & share
Greatest common factor
12
Estimates only.

Your inputs

Example values. Change any of them.

How it’s worked out

See how we got 360

LCM(a,b) = |ab|/GCD(a,b) for nonzero integers. The lcm is zero when either input is zero.

  1. Run the Euclidean algorithm across the input numbers.
  2. Divide the product of each pair by its GCF and repeat across the list.

About this calculator

Signs do not affect the GCF or LCM of the input magnitudes.

Worked example

Least common multiple · 360

LCM(a,b) = |ab|/GCD(a,b) for nonzero integers. The lcm is zero when either input is zero.

  1. Run the Euclidean algorithm across the input numbers.
  2. Divide the product of each pair by its GCF and repeat across the list.

Formula sources

Reference checked November 22, 2026.