Least Common Multiple Calculator
Compute the least common multiple (LCM), also called the lowest common multiple, for 2–10 positive integers. Enter values to get the LCM of multiple numbers with a pairwise LCM chain and a prime factorization table; share deep links to preset inputs.
Least Common Multiple (LCM)
Results
GCD Method (Step-by-step)
Prime Factorization
| Number | Prime Powers |
|---|---|
| 12 | 2^2 × 3^1 |
| 18 | 2^1 × 3^2 |
| 30 | 2^1 × 3^1 × 5^1 |
| Max powers | 2^2 × 3^2 × 5^1 |
| Product | 180 |
How to Calculate LCM
Formulas
Sources: Wolfram MathWorld – Least Common Multiple; Wolfram MathWorld – Greatest Common Divisor
Calculation Steps:
- 1List integersUse 2–10 positive integers
- 2Compute GCDUse Euclidean algorithm for each pair
- 3Iterate LCMLCM = LCM(prev, next)
Important Considerations
⚠️ Input Constraints
Only positive integers are supported; zeros and non-integers are ignored.
Supports 2–10 numbers; extra inputs are ignored.
LCM can grow quickly; extremely large outputs may overflow typical displays.
When numbers are co-prime, LCM equals their product.
Zero is ignored to avoid undefined behavior for LCM(0, n).
Example Cases
Case 1
Because 180 is divisible by 12, 18, and 30.
Case 2
LCM(8,9) = 8×9 / GCD(8,9) = 72.
Tips & Notes
Break each number into primes and multiply the highest powers across all numbers.
Useful for finding common periods, scheduling cycles, or aligning repeating tasks.