Find the least common multiple of two or more whole numbers instantly, right in your browser.
Enter two or more whole numbers to calculate their LCM.
The least common multiple (LCM) of a group of integers is the smallest positive number that all of them divide into with no remainder. It's the mirror image of the greatest common divisor (GCD): the GCD is the largest number that fits INTO your numbers, while the LCM is the smallest number your numbers all fit into.
Rather than listing multiples one by one until a match appears, this calculator uses the relationship between the LCM and the GCD:
For more than two numbers, this is applied pairwise: the LCM of the first two becomes the running result, which is then combined with the next number, and so on.
The LCM of a group of integers is the smallest positive number that every one of them divides into evenly. The LCM of 4 and 6 is 12, since 12 is the smallest number that's a multiple of both.
This calculator uses the identity LCM(a, b) = |a × b| ÷ GCD(a, b), applying it one pair at a time for more than two numbers. This is far more efficient than checking every multiple one by one, especially for larger numbers.
It's defined as 0. Since 0 is a multiple of every integer (0 × n = 0 for any n), a list that includes 0 will always have an LCM of 0 -- this calculator shows that result with an explanation rather than an error.
No. LCM only concerns the magnitude of the numbers involved, so negative values are treated by their absolute value, and the result is always shown as a non-negative number.
Yes. Enter as many integers as you like, separated by commas, spaces, or line breaks, and the calculator finds the LCM across all of them.
No. Every calculation happens locally in your browser using JavaScript. Nothing you enter here is sent to Brekzy or stored anywhere.
Explore Brekzy's growing collection of free calculators, converters, AI tools, and practical resources.