LCM Calculator (Least Common Multiple)

The LCM is the smallest positive integer that is evenly divisible by every number in a set. For 4 and 6, the LCM is 12 - the first multiple that both 4 and 6 divide into with no remainder.

Two reliable methods: list multiples of each number until you find the first one they share, or use prime factorization. With prime factorization, write each number as a product of prime powers, then multiply the highest power of each prime that appears across all inputs. For example, 4 = 2^2 and 6 = 2 x 3, so LCM = 2^2 x 3 = 12.

12. Multiples of 4: 4, 8, 12 ... Multiples of 6: 6, 12 ... The first shared value is 12. You can verify: 12 / 4 = 3 and 12 / 6 = 2, both whole numbers.

For any two positive integers a and b: LCM(a, b) x GCF(a, b) = a x b. So if you know the GCF you can find the LCM with a single division, and vice versa. For 4 and 6: GCF = 2, so LCM = (4 x 6) / 2 = 12.

LCM is most commonly used to find a common denominator when adding or subtracting fractions with different denominators. It also appears in scheduling problems - if two events repeat every 4 days and every 6 days, they next coincide in 12 days - and in number theory and cryptography.

Yes. The calculator reduces pairwise: LCM(a, b, c) = LCM(LCM(a, b), c). Enter as many integers as you need, separated by commas or spaces, and the result updates automatically.

LCM(0, n) = 0 for any nonzero integer n, and LCM(0, 0) is commonly defined as 0. This calculator follows that convention: if any entered value is zero, the pairwise reduction returns 0. It requires at least two valid integer inputs.