What is the least common multiple?

The smallest positive number that every one of the given numbers divides exactly. For 4 and 6 it is 12, since 12 is 3 × 4 and 2 × 6, and nothing smaller works — 4, 8 are not multiples of 6, and 6 is not a multiple of 4. Every other common multiple is itself a multiple of the least one, which is what makes it the natural starting point rather than just the smallest example.

How do I find the lcm of three or more numbers?

Fold them pairwise: take the lcm of the first two, then the lcm of that with the third, and so on. The order makes no difference — checked here across twenty thousand random quadruples in three different orders with no disagreements. What you must not do is divide the product of all of them by their overall gcd, which looks like the two-number rule but is not.

Why does dividing the product by the gcd not work for three numbers?

Because the overall gcd only knows what all of them share, and pairs can share more than that. For 12, 18 and 30 the common factor is 6, but 12 and 18 also share an extra 2 between just the two of them. That extra factor appears twice in the product and the single division cannot remove it, so the answer comes out six times too large. Across forty thousand random triples the shortcut agreed only 28% of the time, and when it does agree it is a coincidence rather than a rule.

What is the quickest way to find the lcm of two numbers?

Find the gcd first — Euclid takes only a few divisions — then compute a ÷ gcd × b. Doing the division before the multiplication keeps the intermediate result no larger than the answer itself, whereas forming a × b first can produce a number far bigger than needed. Listing multiples of each number until they match also works and is fine for small cases, but it becomes hopeless quickly: the lcm of two three-digit numbers can be six digits, which is a lot of listing.

Why is the lcm often so much larger than the numbers?

Because anything the numbers do not share has to be included in full. When two numbers are coprime their lcm is exactly their product, since nothing can be saved. Five two-digit primes have an lcm of over four billion. This is the practical difference from the gcd, which can only shrink as you add numbers while the lcm can only grow — adding a number to the list never makes the lcm smaller.

What is the lcm actually used for?

Two things mainly. Adding fractions needs a common denominator, and the least common denominator is exactly the lcm of the denominators — for 1/4 + 1/6 it is 12, giving 3/12 + 2/12. And anything that repeats on a cycle coincides with another cycle at the lcm of their periods: buses every 12 and 18 minutes depart together every 36, gears with those tooth counts realign after 36 teeth, and two planets with different orbital periods return to the same relative position on the same principle.

What happens when one number divides another?

The larger one is already the answer for that pair. lcm(6, 24) is 24, because 24 is a multiple of both — there is nothing to add. In a longer list this means some numbers can be dropped entirely without changing the result: with 6, 12 and 24 the answer is 24, and either 6 or 12 could be removed and it would still be 24. Note that being individually removable does not always mean several can go at once.

Can the lcm involve zero?

No — it has no value. The only multiple of zero is zero itself, and zero is not a positive multiple of any other number, so there is nothing that is a multiple of both. This is the exact opposite of the gcd, where zero is harmless: every number divides zero, so gcd(a, 0) is simply a. Zero being maximally divisible and minimally multiple-able is why it behaves so differently in the two calculations.

How do I find the lcm from prime factorisations?

Take the largest power of each prime that appears anywhere. For 12 = 2²·3 and 18 = 2·3², the largest powers are 2² and 3², giving 4 × 9 = 36. The gcd is the same table read from the other end — the smallest power of each prime that appears in every number, which here is 2 and 3, giving 6. It is a clear way to see the relationship, though for large numbers Euclid is far quicker, since factorising is much harder than finding a gcd.

Can the lcm be larger than the product of the numbers?

Never for two numbers. The lcm is a × b ÷ gcd, and the gcd is at least 1, so the lcm is at most the product — equal exactly when they are coprime. For three or more the same holds against the full product, since each fold can only reach the product of what has gone before. If a calculation produces something larger than the product, the arithmetic is wrong, and the usual cause is the abc ÷ gcd shortcut.

LCM Calculator

The least common multiple is the smallest number that every input divides exactly. For two numbers it is a × b ÷ gcd(a, b), and for more than two you fold: take the lcm of the first pair, then of that result with the next. The folding matters, because the natural-looking shortcut is wrong. Dividing...

For three or more numbers, abc ÷ gcd is not the lcm. The two-number rule tempts people into it, and it is wrong about 71% of the time. On 2, 3 and 4 it gives 24 where the answer is 12; on 6, 10 and 15 it gives 900 where the answer is 30. The way that works is to fold: take the lcm of the first two, then of that with the third.

THE NUMBERS

LCM OF 12, 18

Each number goes into it a whole number of times: 12 × 3, 18 × 2. Their gcd is 6, which is what stops the lcm being the full product of 216.

GCD

the shared part

PRODUCT OF ALL

216

6× the lcm

DIGITS IN THE LCM

lcm grows where gcd shrinks

NUMBERS GIVEN

each one matters

Step	Running lcm	Multiplied by
start with 12	12	—
fold in 18	36	× 3

WHAT IT MEANS

This is what an lcm is for. Two things repeating on different cycles coincide for the first time at the lcm of their periods, and then every lcm after that. Buses every 12 and 18 minutes leave together every 36. Gears with 12 and 18 teeth return to their starting alignment after 36 teeth pass. The same number answers both.

Folded pairwise · exact for any size of input

Created with❤️byeaglecalculator.com

HOW TO USE

1
Enter two or more whole numbers. Signs are ignored, since every multiple of −12 is also a multiple of 12 and the sign changes nothing about which numbers are common multiples.
2
Watch the fold rather than just the answer. Each row shows the running lcm and what the next number multiplied it by — a factor of one means that number was already covered.
3
Read the cycle diagram if the numbers are periods. The rows tick at their own intervals and meet for the first time at the lcm, which is what makes the answer useful rather than just correct.
4
With three or more numbers, compare the answer with the shortcut the page shows. Dividing the product by the overall gcd is the common mistake, and seeing both figures side by side makes the gap obvious.

REFERENCE FORMULAS

Rule	Formula	What it is for
Two numbers	lcm(a, b) = a × b ÷ gcd(a, b)	Exact for two. Divide before multiplying to keep the intermediate small.
Three or more	lcm(a, b, c) = lcm(lcm(a, b), c)	Fold pairwise. The order changes nothing about the result.
The common error	lcm(a,b,c) ≠ abc ÷ gcd(a,b,c)	Wrong about 71% of the time. On (2,3,4) it gives 24 instead of 12.
From prime exponents	take the largest power of each prime	The mirror of gcd, which takes the smallest. Both read off the same table.
Coprime numbers	gcd = 1 ⟹ lcm = a × b	Nothing is shared, so nothing is saved. This is why lcm grows so fast.
One divides the other	a \| b ⟹ lcm(a, b) = b	The larger already contains the smaller. gcd is then a.
With zero	lcm(a, 0) is undefined	The only multiple of zero is zero, which is not a multiple of a.
Repeating events	periods a and b coincide every lcm(a, b)	Buses every 12 and 18 minutes meet every 36. The first coincidence is the lcm.
Least common denominator	LCD = lcm of the denominators	The same quantity under a different name, for adding fractions.
Scaling	lcm(ka, kb) = k · lcm(a, b)	A shared factor pulled out stays out. The same rule holds for gcd.
Product identity	gcd(a,b) × lcm(a,b) = a × b	For exactly two numbers. It does not extend to three unless pairwise coprime.
First n integers	lcm(1…20) = 232,792,560	Grows roughly like eⁿ, driven by the prime powers below n.
Bound	lcm(a, b) ≤ a × b	With equality exactly when they are coprime. It is never larger.
Multiples	every common multiple is a multiple of the lcm	Which is what makes it least — the others are all built from it.

FREQUENTLY ASKED QUESTIONS

RELATED CALCULATORS

4 to the Power of 2

Calculate instantly →

4 to the Power of 8

Calculate instantly →

3 to the Power of 1

Calculate instantly →

5 to the Power of 5

Calculate instantly →

MORE ALGEBRA CALCULATORS

24 Times Table

Calculate instantly →

Quadratic Equation Solver

Calculate instantly →

Logarithm Calculator

Calculate instantly →

Fraction Calculator

Calculate instantly →

Fraction Simplifier

Calculate instantly →

Linear Equation Solver

Calculate instantly →

25 Times Table

Calculate instantly →

26 Times Table

Calculate instantly →

27 Times Table

Calculate instantly →

Simultaneous Equations Solver (2×2)

Calculate instantly →

28 Times Table

Calculate instantly →

Exponent Calculator

Calculate instantly →

29 Times Table

Calculate instantly →

30 Times Table

Calculate instantly →

Times Tables Mega Calculator

Calculate instantly →

Square Root of 10

Calculate instantly →

Square Root of 1

Calculate instantly →

Square Root Mega

Calculate instantly →

Square Root of 2

Calculate instantly →

23 Times Table

Calculate instantly →

Was this calculator helpful?

Last updated: August 4, 2026 · Folded pairwise, never abc ÷ gcd · Two numbers coincide for the first time at their lcm.