The least common multiple (LCM) is the smallest positive multiple shared by a set of integers. For example, the common multiples of 2 and 3 include 6, 12, and 18, so their LCM is 6. This calculator accepts two or more integers and shows the final LCM, the GCD and LCM used at each merge, and the prime factorization of each original input.
It is useful for finding common denominators, checking repeating schedules, solving integer exercises, and reviewing an answer step by step instead of relying on a single number.
Enter comma-separated integers such as 12, 18, 30. You must enter at least two non-zero integers. The page accepts negative numbers and spaces around values, but not decimals, fractions, unit labels, letters, or internal spaces such as 1 000.
The page tries to recalculate as the input changes, and the Calculate button runs the same calculation manually. An incomplete list may show a temporary validation message; finish the list to get a result.
Enter at least two non-zero integers. You can enter more numbers in one comma-separated list, and the page will show the merge order.
Yes. The calculator uses absolute values, so -12 and 12 produce the same least common multiple.
This calculator explicitly rejects 0 and returns an error. For special cases involving zero, confirm the mathematical definition you want to use.
The GCD is the greatest shared factor, while the LCM is the smallest positive shared multiple. For two non-zero integers, GCD(a,b) × LCM(a,b) = |a×b|.
It does not change the final LCM, but it does change the order of the pairwise merge steps shown on the page.
Calculate the least common multiple (LCM) of two or more integers with pairwise GCD/LCM steps and prime factor breakdowns.