LCM Calculator
Least common multiple of any list of positive whole numbers — with step-by-step prime factorization and the GCD shown as a bonus.
What is the least common multiple?
The least common multiple (LCM) of a set of positive integers is the smallest positive number that every input divides into with no remainder. It is what you need whenever repeating things must line up: common denominators for fractions, syncing schedules, or packing quantities into several bundle sizes.
LCM calculator, piece by piece
Each card explains one part of what this calculator does with your input — how it factors each number, how it builds the LCM from those factors, and the shortcut that keeps it fast for large values.
List multiples — the visual method
Write out multiples of each number and look for the smallest one that appears in every list. This is what happens on paper, and the calculator's first result box mirrors it: the smallest number every input divides into.
Prime factorization — how the calculator builds the LCM
Every result on this page uses the prime-factorization method: factor each input, then for each prime that appears, take the highestpower seen across the inputs. Multiplying those together gives the LCM. The bar chart above shows exactly which exponent won for each prime.
GCD shortcut — why the answer stays exact for huge numbers
The calculator also reports the GCD, and the two are linked by a × b = GCD(a,b) × LCM(a,b). Folding this identity pairwise across the list avoids ever multiplying enormous numbers together — that is how the tool stays instant even when the inputs get big.
Features of this calculator
- Accepts a comma- or space-separated list of two or more positive integers
- Shows the prime factorization of every input
- Explains how the LCM is built by taking the highest power of each prime
- Also reports the GCD of the same set of numbers
- Handles large numbers without overflow using the GCD identity
Frequently asked questions
+What is the difference between LCM and GCF?
GCF is the largest number that divides every input; LCM is the smallest number every input divides into. For two positive integers they satisfy a × b = GCF(a, b) × LCM(a, b).
+How do I find the LCM of more than two numbers?
Work pairwise: LCM of the first two, then the LCM of that with the next number, and so on until every input has been folded in.
+Can the LCM be smaller than the largest input?
No — the LCM must be a multiple of every input, so it is always at least as large as the biggest number in the list.