Enter two or more positive integers, separated by commas, to find their least common multiple (LCM) — also called the lowest common multiple — with GCD and prime-factorization steps.
Formula
The LCM is the smallest positive integer divisible by every listed number.
Prime factorization. Factor each integer, keep the highest power of each prime, and multiply:
LCM(21, 14, 38)
21 = 3 × 7
14 = 2 × 7
38 = 2 × 19
LCM = 2 × 3 × 7 × 19 = 798
Greatest common divisor. For two positive integers a and b,
LCM(a, b) = (a × b) / GCD(a, b)
Extra integers fold in the same way: LCM(a, b, c) = LCM(LCM(a, b), c).
LCM and GCF are inverses for two numbers: LCM(a, b) × GCF(a, b) = a × b. Use the GCF calculator when you want the greatest common factor.
Examples
Default list 330, 75, 450, 225
Prime factors: 330 = 2 × 3 × 5 × 11, 75 = 3 × 5 × 5, 450 = 2 × 3 × 3 × 5 × 5, and 225 = 3 × 3 × 5 × 5. Highest powers are 2, 3², 5², and 11, so the LCM is 4950. The GCD of the same list is 15.
Page example 18, 26
GCD(18, 26) = 2, so LCM = (18 × 26) / 2 = 234. Prime factors 2 × 3 × 3 × 13 give the same result.
Page example 21, 14, 38
LCM(14, 38) = 266, then LCM(266, 21) = 798. The primes 2, 3, 7, and 19 multiply to the same value.