Last updated: October 2026
By CalcOrigin Editorial Team
What the Least Common Multiple Is
The least common multiple of a set of integers is the smallest positive integer that every number in the set divides without a remainder. For 9 and 15 the answer is 45: the multiples of 9 run 9, 18, 27, 36, 45, and the multiples of 15 run 15, 30, 45, so 45 is the first value in both lists.
Two properties follow from the definition and are worth remembering. The LCM can never be smaller than the largest number in the set, because it has to be a multiple of that number. And it always exists for positive integers, since the product of all the numbers is itself a common multiple, just rarely the smallest one.
Several special cases collapse the work. If one number divides another, the larger one is the LCM, so LCM(4, 12) = 12. If the numbers share no prime factor, their LCM is simply their product, so LCM(7, 11) = 77. And if every number in the set is a power of the same prime, the LCM is the largest of those powers.
The concept matters because it is the smallest common ground between two rhythms. Fractions need it to find a common denominator, schedules need it to find when two repeating events coincide again, and number theory uses it as one half of the pairing with the greatest common divisor.
Listing Multiples
The most direct method is to write out the multiples of each number in order and look for the first value that appears in every list. It requires no factorization and no formula, which makes it a good way to see what the definition actually means.
Take 10 and 14. The multiples of 10 are 10, 20, 30, 40, 50, 60, 70, and the multiples of 14 are 14, 28, 42, 56, 70. The first shared value is 70, so LCM(10, 14) = 70. Nothing about the method is subtle; the answer is simply the first overlap.
The trouble is arithmetic volume. For two coprime numbers near 100 the LCM is close to 10,000, and the shorter of the two lists needs around a hundred entries before the match appears. For three or more numbers, you maintain a list per number, and the chance of an early match falls quickly.
There is also a specific trap: a value can appear in one list and look familiar without being in the other. When checking 6 and 9, the multiple 12 belongs to the 6 list and is easy to mistake for a match, but 9 does not divide 12. The genuine answer is 18.
Use listing for small numbers or for explaining the idea, and switch to factorization or the GCD formula once the numbers exceed two digits.
Prime Factorization
Factor each number into primes, then take the highest power of every prime that appears anywhere in the set. The product of those highest powers is the LCM. This works because the LCM must contain enough of each prime to be divisible by every number in the set.
Example with 8, 9, and 12. The factorizations are 8 = 2³, 9 = 3², and 12 = 2² × 3. The primes involved are 2 and 3. The highest power of 2 is 2³, taken from 8, and the highest power of 3 is 3², taken from 9. Multiplying gives 8 × 9 = 72. Checking: 72 ÷ 8 = 9, 72 ÷ 9 = 8, and 72 ÷ 12 = 6, all whole numbers.
A second example with a shared prime in all three numbers. Factor 14, 21, and 35: they are 2 × 7, 3 × 7, and 5 × 7. The distinct primes are 2, 3, 5, and 7, each appearing to the first power. The product is 2 × 3 × 5 × 7 = 210, and 210 ÷ 14 = 15, ÷ 21 = 10, ÷ 35 = 6.
A table helps when the set is larger. List the distinct primes as rows and the factorizations as columns, then circle the largest exponent in each row. The method is mechanical enough to check, and it makes the reason for each factor visible in a way that the GCD formula does not.
Factor trees are the usual way to produce the factorizations by hand. Divide repeatedly by the smallest prime that goes in evenly, and stop when the quotient is prime. For 84, that gives 2 × 42, then 2 × 2 × 21, then 2 × 2 × 3 × 7, or 2² × 3 × 7.
The GCD Formula
For two positive integers, the product of the numbers equals the product of their LCM and their greatest common divisor. Rearranging gives a formula that is usually the fastest route when a GCD is already available:
LCM(a, b) = (a × b) ÷ GCD(a, b)
Work through 84 and 132. Their GCD is 12, which the Euclidean algorithm finds in four steps: 132 − 84 = 48; 84 − 48 = 36; 48 − 36 = 12; 36 ÷ 12 leaves no remainder. Then 84 × 132 = 11,088, and 11,088 ÷ 12 = 924. Checking, 924 ÷ 84 = 11 and 924 ÷ 132 = 7.
The Euclidean algorithm is worth knowing because it avoids factorization entirely. Repeatedly replace the larger number with the remainder of dividing it by the smaller, and stop when the remainder is zero; the last nonzero remainder is the GCD. For large numbers this is dramatically faster than trial division.
For three or more numbers, apply the formula pairwise. Find the LCM of the first two, then the LCM of that result and the third, and continue. Order does not matter, because the operation is associative: LCM(LCM(a, b), c) = LCM(a, LCM(b, c)).
One caution: the product formula applies to two numbers only. There is a three-number analogue involving pairwise GCDs, but it is easy to get wrong, and the sequential method is more reliable.
What This Calculator Does
Enter integers separated by commas and the calculator returns their least common multiple, along with the factorization steps that produced it. It accepts any number of inputs, which is useful because the manual methods get progressively more tedious as the set grows.
- Handles two numbers or twenty, without a separate mode.
- Shows the prime factorizations so the result can be checked rather than trusted.
- Returns the LCM only, not the larger product of all inputs, which is the most common manual error.
- Works on any device, with no account and no download.
The inputs must be positive integers. Decimals and fractions are outside the definition unless they are first converted to a common form, and zero has no useful LCM in this context. Negative signs are ignored, since divisibility is defined on magnitudes.
The step display is the part that makes the tool useful for learning. Seeing that 72 comes from 2³ × 3² explains the method in a way that a bare answer does not, and it lets a student compare the calculator's factorization with their own.
For related work, the GCF calculator finds the other half of the pair, the prime factorization calculator breaks a single number into primes, and the fraction calculator applies the result to common denominators.
Errors to Watch For
These mistakes account for nearly every wrong LCM produced by hand.
- Multiplying everything together. The product is a common multiple but rarely the least one. For 6 and 10 the product is 60, while the LCM is 30.
- Taking the lowest exponent instead of the highest. The LCM needs enough of each prime to cover the most demanding number in the set. With 4 and 8, the answer is 2³ = 8, not 2² = 4.
- Forgetting a prime that appears in only one number. In LCM(14, 21, 35), every factorization contains a 7, and it is easy to drop the 2, 3, or 5 that appears only once. Missing any of them gives a wrong answer.
- Confusing LCM with GCF. The LCM is at least as large as the biggest input; the GCF is at most as large as the smallest. Getting a result smaller than the largest input means something went wrong.
- Applying the two-number product formula to three numbers. The formula LCM = abc ÷ GCF(a, b, c) is not valid. Work sequentially instead.
- Treating a shared factor as a shared multiple. Two numbers can both be divisible by 6 without 6 being a multiple of either. Divisibility runs the other way.
- Stopping at the first repeated value in a list. Check that the value divides every input, not just the two you were looking at.
Shortcuts Worth Knowing
Most LCM problems in homework and in practice can be shortened before any calculation starts.
Drop any number that divides another. If the set contains 6 and 18, the 6 contributes nothing, because every multiple of 18 is already a multiple of 6. Removing redundant inputs shrinks the problem without changing the answer.
Check for coprimality. If no two numbers share a prime factor, the LCM is their product, and you are finished. LCM(7, 11, 13) = 1,001 by inspection, because all three are prime and distinct.
Use the GCD for pairs. For two numbers, dividing the product by the GCD is faster than factoring both, especially when the numbers are large. The Euclidean algorithm produces the GCD in a handful of steps.
Factor once, reuse often. If you need the LCM of several numbers from the same family, factorize the set once and read off the highest powers. Rewriting the factorizations for each new pair wastes effort.
Verify by division. Divide the answer by each input. Every quotient must be a whole number. This check costs seconds and catches nearly every error above.
Sanity-check the size. The LCM is at least the largest input and at most the product of all inputs. An answer outside that range is wrong by definition.
Where LCM Shows Up
Any situation with two or more repeating cycles produces a question that the LCM answers: when do they line up again?
Transit and scheduling. If one bus comes every 12 minutes and another every 18, they arrive together every 36 minutes, because 36 is the smallest number both 12 and 18 divide. The same reasoning sets maintenance intervals for equipment that is serviced on two different cycles, and it explains why a 3-day and a 5-day medication schedule coincide every 15 days.
Cooking and measurement. A recipe calling for 1/3 cup and another calling for 1/4 cup can both be measured with a 1/12 cup scoop, since 12 is the LCM of 3 and 4. Doubling a recipe with denominators of 3 and 8 needs a 24th-cup measure for exact work, though most cooks simply use a scale.
Music. A pattern in 4/4 and a pattern in 3/4 realign every 12 beats, because 12 is the LCM of 4 and 3. That is why a three-against-four polyrhythm resolves on the twelfth subdivision, and why composers use it to create tension that releases on a predictable beat.
Machinery. Two meshing gears with 8 and 12 teeth return to their starting tooth alignment after 24 teeth have passed, which is 3 turns of the small gear and 2 turns of the large one. Wear patterns and lubrication schedules follow the same cycle, which is why gear tooth counts are often chosen to be coprime.
Astronomy, with a caveat. When two orbital periods are in a simple whole-number ratio, conjunctions repeat at the LCM. Real planets rarely have exact ratios, so astronomers use the synodic period instead, computed as the reciprocal of the difference between the two orbital frequencies. The LCM is the special case where the ratio is exact.
LCM and Fraction Arithmetic
Adding or subtracting fractions requires a common denominator, and the least common denominator is the LCM of the denominators. Using the smallest possible denominator keeps the numerators small and reduces the amount of simplification at the end.
Add 1/6 and 3/8. The LCM of 6 and 8 is 24, so convert both: 1/6 = 4/24 and 3/8 = 9/24. Adding gives 13/24, which is already in lowest terms. Multiplying the denominators instead would have produced 48ths and a fraction that needs reducing.
Subtract 2/9 from 5/12. Factorizing, 12 = 2² × 3 and 9 = 3², so the LCM is 2² × 3² = 36. Converting gives 15/36 − 8/36 = 7/36.
Comparison uses the same step. To decide whether 5/6 or 7/9 is larger, put both over 18: 15/18 against 14/18, so 5/6 is larger by 1/18. Cross-multiplication reaches the same conclusion faster for a single comparison, but the common-denominator approach scales better when several fractions are being ordered.
Mixed numbers need one extra move: convert to improper fractions first, then find the LCD. For 2 1/3 + 1 1/4, the improper forms are 7/3 and 5/4, the LCM of 3 and 4 is 12, and the sum is 28/12 + 15/12 = 43/12, or 3 7/12.
The LCM is not the only valid denominator. Any common multiple works, and sometimes the product is easier to find than the LCM. The reason to prefer the LCM is bookkeeping: smaller numbers mean fewer opportunities for arithmetic slips and less reduction at the end.
LCM and GCD Together
For any two positive integers, the LCM and the greatest common divisor satisfy a clean identity:
LCM(a, b) × GCD(a, b) = a × b
Test it on 12 and 18. The GCD is 6 and the LCM is 36, and 6 × 36 = 216, which equals 12 × 18. The identity lets you compute either value from the other, so a GCD found by the Euclidean algorithm gives the LCM with one multiplication and one division.
The reason is visible in the prime factorizations. Write 12 = 2² × 3 and 18 = 2 × 3². The GCD takes the lower power of each shared prime: 2 × 3 = 6. The LCM takes the higher power of each prime that appears: 2² × 3² = 36. Multiplying them pairs each low power with its matching high power, and every prime ends up with an exponent equal to the sum of the two, which is exactly the exponent in the product 12 × 18 = 2³ × 3³.
The identity holds for two numbers only. For three numbers, the corresponding statement involves pairwise GCDs and is easier to avoid than to remember. Sequential application of the two-number formula remains the practical approach.
Knowing both values is also a useful check. If a calculation produces an LCM and a GCD whose product does not match the product of the inputs, one of them is wrong. The GCF calculator computes the other half of the pair directly.
Three or More Numbers
Two methods scale to any set size, and both are worth knowing because they fail in different ways.
Sequential Method
Take the LCM of the first two numbers, then the LCM of that result with the third, and continue until the set is exhausted. Because the operation is associative, the order of combination does not affect the answer.
For 12, 18, and 30, start with 12 and 18. Their GCD is 6, so the LCM is 216 ÷ 6 = 36. Then combine 36 with 30: the GCD is 6, so the LCM is 1,080 ÷ 6 = 180. Check: 180 ÷ 12 = 15, ÷ 18 = 10, ÷ 30 = 6.
Direct Factorization
Factorize every number at once and take the highest power of each prime across the whole set. For 6, 8, 9, and 15, the factorizations are 2 × 3, 2³, 3², and 3 × 5. The primes are 2, 3, and 5, with highest powers 2³, 3², and 5, giving 8 × 9 × 5 = 360. Check: 360 ÷ 6 = 60, ÷ 8 = 45, ÷ 9 = 40, ÷ 15 = 24.
The direct method is usually faster for large sets because it avoids repeated GCD computations. The sequential method is easier to do incrementally when numbers arrive one at a time, and it produces intermediate results that can be checked as you go.
Either way, remove redundant numbers first. In the set 4, 6, 8, 24, the 24 is a multiple of all the others, so it alone determines the answer and the rest can be ignored.
Summary
The least common multiple is the smallest number that every member of a set divides exactly. Three methods find it: listing multiples for small values, prime factorization for sets of any size, and the product-over-GCD formula for pairs.
In practice, remove redundant inputs, check whether the numbers are coprime, and verify the result by dividing it by each input. Those three habits prevent almost every error the manual methods invite.
Beyond arithmetic, the LCM is the natural language for repeating cycles, which is why it appears in scheduling, music, gear design, and fraction work. The GCF calculator, factor calculator, prime factorization calculator, and fraction calculator cover the neighboring operations if you want to keep going.
