Free least common multiple (LCM) calculator
Find the least common multiple of two or more numbers — enter your numbers to see the LCM and its use in fractions and scheduling, updated live, as you type.
On this page10 sections
LCM via |a×b|/GCF, extended to N numbers. Source: Hardy & Wright.
Results are estimates. Consult a professional.
How the least common multiple calculator works
The least common multiple (LCM) of two or more integers is the smallest positive integer that is divisible by all of them. It is essential for adding fractions with unlike denominators, scheduling repeating events, and working with gear ratios.
The GCF-based method is fastest for two numbers. For more than two numbers, compute pairwise: LCM(a, b, c) = LCM(LCM(a, b), c). The prime factorization method is more transparent for small numbers.
Weisstein, Eric W. — Least Common Multiple. MathWorld, Wolfram Research.Worked example: LCM(12, 18)
Find the least common multiple of 12 and 18 using both methods.
LCM for common number pairs
The table below covers the most frequently needed LCM values, particularly for fraction arithmetic.
| a | b | GCF(a, b) | LCM(a, b) |
|---|---|---|---|
| 4 | 6 | 2 | 12 |
| 6 | 9 | 3 | 18 |
| 8 | 12 | 4 | 24 |
| 12 | 18 | 6 | 36 |
| 15 | 20 | 5 | 60 |
| 6 | 10 | 2 | 30 |
| 14 | 21 | 7 | 42 |
| 16 | 24 | 8 | 48 |
LCM(a, b) = (a × b) / GCF(a, b). These pairs cover the most common fraction denominators in arithmetic.
Tips for finding the least common multiple
LCM comes up constantly in fraction arithmetic and real-world scheduling. These tips make the process faster.
- Use the GCF shortcut — always faster than listing multiples by hand; compute GCF first, then divide the product by it.
- LCM of coprime numbers is their product — if GCF(a, b) = 1, then LCM(a, b) = a × b; e.g., LCM(7, 9) = 63.
- Finding a common denominator — to add ⅓ + ¼, find LCM(3, 4) = 12, then rewrite as 4/12 + 3/12 = 7/12.
- Scheduling repeating events — if event A repeats every 4 days and event B every 6 days, they next coincide on day LCM(4, 6) = 12.
- GCF × LCM = a × b — this identity lets you cross-check; if GCF(a,b) × LCM(a,b) ≠ a × b, recheck your work.
Accuracy and limitations
This calculator computes LCM exactly using the GCF-based formula for any positive integers within JavaScript's safe integer range (up to 2⁵³ − 1). For very large inputs, the intermediate product a × b can overflow before division; the calculator detects this and uses the safer equivalent LCM(a, b) = (a / GCF(a, b)) × b to avoid overflow. Inputs must be positive integers; LCM is not defined for zero or negative integers in this context.
Key terms
About this calculator
Part of our math calculators suite — explore all calculators.