LCM Calculator

What Is the Least Common Multiple?

Any pair of whole numbers has infinitely many common multiples and exactly one smallest. 4 and 6 share 12, 24, 36, 48 and on without end; 12 is the one the phrase names, and it is the only one worth finding, because every other common multiple is itself a multiple of it.

Multiple, Common Multiple, Least Common Multiple

Three terms sit inside the phrase and they are usually taught in a single lesson, which is why they blur. A multiple of 4 is 4 times a whole number. A common multiple is a number that is a multiple of everything on your list at once. The least common multiple is the smallest of those.

• Multiple — the number times a whole number. 6 has multiples 6, 12, 18, 24, 30 and so on, an infinite list that starts at 6 and never ends.
• Common multiple — a number on every list at the same time. 4 and 6 share 12, 24, 36, 48, all the way up.
• Least common multiple — the first of those shared entries. LCM(4, 6) = 12, which this calculator prints as LCM = 12.
• Least common denominator — the same number wearing a different hat. Adding 1/4 and 1/6 needs the LCM of 4 and 6, so the LCD is 12. There is no separate calculation.
• Notation — [a, b] in number theory, lcm(a, b) or LCM(a, b) in school work. This page uses LCM throughout, and so does the panel.

Two bounds are worth fixing in your head before you calculate anything, because between them they catch most arithmetic slips. The LCM is never smaller than the largest number you entered, and never larger than all of them multiplied together. For 4 and 6 that pins the answer between 6 and 24, and it lands on 12.

The infinite tail matters more than it looks. Because every common multiple of a list is itself a multiple of the least one, the single number 12 stands in for the entire set 12, 24, 36, 48 — which is why finding the smallest settles the question instead of starting it.

LCM and GCF Point in Opposite Directions

The greatest common factor is the largest number that divides into your numbers. The least common multiple is the smallest number your numbers divide into. One looks down at what they are built from, the other looks up at where they finally meet, and the two answers are locked together by a single identity.

Multiply the two results and something familiar appears. GCF(12, 18) × LCM(12, 18) = 6 × 36 = 216, and 12 × 18 is 216 as well. MathWorld states the identity as GCD(a,b)·LCM(a,b) = ab, and it is exact for every pair of positive whole numbers — which is precisely why this calculator can reach the LCM by way of the GCF instead of hunting through multiples.

The other half of that pair has a page of its own, with Euclid's working shown line by line, in the GCF Calculator.

It is a pair rule and nothing more, though. Enter 24, 36, 60 and the panel returns LCM 360 alongside GCF 12; those multiply to 4,320, while the three numbers themselves multiply to 51,840. Stretching the identity to three inputs is the most common thing people get wrong with it.

The Two Questions That Send People Here

Almost every real LCM problem has one of two shapes, and they look nothing alike until you write them down as numbers.

• Adding or comparing fractions. 1/4 + 1/6 cannot be added until both sit over the same denominator, and the smallest one that works is LCM(4, 6) = 12: 3/12 + 2/12 = 5/12.
• Two cycles meeting again. A bus every 12 minutes and a bus every 18 minutes leave together, then next coincide at LCM(12, 18) = 36 minutes.
• Gears and belts. A 16-tooth gear meshed with an 18-tooth gear returns to its starting alignment after LCM(16, 18) = 144 tooth-passes — nine turns of the small wheel against eight of the large.
• Packaging that has to come out even. Items sold in tens beside items sold in eights first match at LCM(10, 8) = 40: four of the first against five of the second.
• Repeating schedules. A task every 6 days and a task every 9 days collide on day 18, then day 36, then day 54 — LCM(6, 9) = 18 and its own multiples.

The gear case shows why the small print on the calculator's second line is worth reading. Enter 16, 18 and the panel prints (×9, ×8), because 16 × 9 = 144 and 18 × 8 = 144. Every alignment problem carries that same structure: the LCM tells you when, and the multipliers tell you how many cycles each side has completed by the time it happens.

How Do You Calculate the LCM?

Three methods are standard, and they always agree. Listing multiples is taught first and gets slow fastest. Prime factorization scales to any size and to any length of list. The GCF identity is what this calculator runs, because it collapses the whole search into one multiplication and one division.

The LCM Formula, Written Out

There are really two formulas plus a rule. The first handles a pair, the second folds that pair rule along a longer list, and the third builds the answer out of prime factorizations without any division at all.

THE PAIR FORMULA
LCM(a, b)  =  (a × b) ÷ GCF(a, b)

MORE THAN TWO NUMBERS — fold left
LCM(a, b, c)  =  LCM( LCM(a, b), c )

FROM PRIME FACTORIZATIONS
take every prime that appears, at its HIGHEST power
12 = 2^2 × 3        18 = 2 × 3^2
LCM = 2^2 × 3^2 = 36

The pair formula is the identity GCD(a,b)·LCM(a,b) = ab rearranged, and dividing by the GCF is what stops the answer over-counting. 12 × 18 = 216 counts the shared factor 6 twice over, once from each number; removing one copy leaves 36, and 36 is the first number both 12 and 18 reach.

MathWorld gives the fold as an identity rather than a convenience: LCM(a,b,c) = LCM(LCM(a,b),c) = LCM(a,LCM(b,c)). The order you fold in cannot change the result, which is why this tool accepts your list in whatever order you happen to type it — 24, 36, 60 and 60, 24, 36 both return 360.

Method 1: List the Multiples Until They Meet

The method everyone learns first. Write out each times table and stop at the first entry that appears on all of them.

For small numbers nothing beats it, and it is the only method that shows a beginner what the answer actually means. It also collapses quickly. LCM(11, 13) is 143, which is the thirteenth multiple of 11 and the eleventh of 13 — twenty-four entries written out to find one number. LCM(16, 18) is 144, arriving at the ninth multiple of 16 and the eighth of 18.

Two shortcuts trim most of the work. Only one list is genuinely needed: walk the multiples of the LARGER number and test each one against the smaller, so 18, 36 settles LCM(12, 18) in two steps where the 12 times table takes three. And if the larger number already divides by the smaller, you are finished before you start — LCM(6, 18) = 18, and the panel confirms it with the multipliers (×3, ×1).

Method 2: Prime Factorization, Every Prime at Its Highest Power

Break each number into primes, then build a new number from every prime that appeared, each raised to the largest exponent it reached in any single factorization. MathWorld describes exactly this procedure: express each number as a product of prime powers, take the highest power of each prime, multiply them together. It rests on the fundamental theorem of arithmetic, which the NIST Digital Library of Mathematical Functions states as every integer n > 1 being representable uniquely as a product of prime powers.

Set the GCF rule beside it and the symmetry is exact: the GCF takes every SHARED prime at its lowest power, the LCM takes every prime that appears anywhere at its highest. For 12 and 18 that is 2 × 3 = 6 against 2^2 × 3^2 = 36 — the same two primes, read from opposite ends.

This is the only method that extends to a long list without extra machinery. Line the factorizations up in columns, take the tallest exponent in each column, and you are done in one pass however many numbers there are. It is also what makes the fold in method three correct rather than merely convenient.

Method 3: The GCF Identity, Which Is What This Calculator Runs

This tool never lists a multiple and never factorizes anything. It finds the GCF with Euclid's algorithm — repeatedly replace the larger number by the remainder of dividing it by the smaller, until the remainder reaches zero — then divides the product by that GCF. For a longer list it repeats the same two moves once per extra number, carrying the running answer forward.

LCM(24, 36, 60), folded left

step 1    GCF(24, 36) = 12
          LCM(24, 36) = 24 × 36 ÷ 12 = 864 ÷ 12 = 72

step 2    GCF(72, 60) = 12
          LCM(72, 60) = 72 × 60 ÷ 12 = 4,320 ÷ 12 = 360

answer    LCM = 360

Euclid is why this is quick. GCF(24, 36) resolves in three remainder steps — 24 mod 36, then 36 mod 24, then 24 mod 12 — rather than two factorizations, and the number of steps grows with how many digits a number has rather than with how large it is, so a nine-digit pair costs barely more than a two-digit pair. Nothing here searches; every line is arithmetic of a known length.

The panel says as much on every result. The third line reads Method: LCM(a, b) = a × b ÷ GCF(a, b), folded across the list, and it prints identically whether you entered two numbers or ten.

Step by Step With This Calculator

One field, one button, four lines of output:

• Type your numbers into the Numbers box, separated by commas — 12, 18 or 24, 36, 60. Spaces work as separators too, so 4 6 is read the same as 4, 6.
• Press Calculate. The box arrives already holding 4, 6, so the page has run once on load and the readout says LCM = 12 before you touch anything.
• Read the four lines: the LCM as the large readout, then your numbers with their multipliers, then the method, then the GCF.
• Copy result puts all four lines on the clipboard as plain text.
• Reset returns the panel to a dash and the line “Enter your details and press ‘Calculate’ to see your results.” It restores the box to its starting 4, 6 rather than emptying it.

It does not recalculate as you type. Change 4, 6 to 12, 18 and the readout keeps saying LCM = 12 until you press Calculate — worth knowing when you are working down a list of pairs and an answer looks suspiciously like the last one.

Three input habits account for nearly every rejection. Thousands separators break the parse, because the comma is the separator: 1,000, 4 is read as the three numbers 1, 000 and 4, and 000 is zero, so the whole thing is refused. Decimals are refused outright rather than rounded — 4.5, 6 returns the notice, while 4, 6.0 is accepted because 6.0 is a whole number written long. And the list stops at ten values.

Worked Example: LCM of 12 and 18

Type 12, 18 into the box and press Calculate. Every line in the table below is what the panel returns, character for character.

Three independent checks agree. 36 ÷ 12 = 3 and 36 ÷ 18 = 2, which is where (×3, ×2) comes from. The formula gives 12 × 18 = 216, then 216 ÷ 6 = 36. And by hand, 36 is the first entry shared by 12, 24, 36 and 18, 36.

Notice the readout itself. It reads LCM = 36 rather than a bare 36, because the formula sends its label and its number as a single string and the large readout prints that string whole. The equals sign is part of the answer, not a stray character.

Worked Example: Three Numbers at Once

A third number changes nothing about the method; it just runs the pair rule a second time. Enter 24, 36, 60 and the panel returns LCM = 360, with the line Numbers: 24, 36, 60 — each divides 360 exactly (×15, ×10, ×6) beneath it and a GCF of 12 at the bottom.

Every multiplier checks out: 24 × 15 = 360, 36 × 10 = 360 and 60 × 6 = 360. All three land on the same number, which is the definition of the LCM being satisfied in front of you rather than asserted.

Retype the same three in a different order and the answer holds. 60, 24, 36 folds as LCM(60, 24) = 120 and then LCM(120, 36) = 360, arriving at the same place by a different route; the only visible change is that the multipliers come back reordered to match, as (×6, ×15, ×10).

LCM Chart: Every Pair From 1 to 12

The pairwise chart is a genuine lookup rather than filler. The Common Core standard for grade 6 asks students to find the least common multiple of two whole numbers less than or equal to 12, so a 12 by 12 grid covers the exact range the question is set in. Every cell below came from running this calculator on that pair.

The 12 × 12 LCM Grid

Pick a row and a column and meet at the cell: row 8, column 12 gives 24, and so does row 12, column 8. The grid is symmetric because LCM(a, b) and LCM(b, a) are the same question asked in a different order.

Five Patterns in the Grid

A table this size rewards being read for its shape as well as searched for single values:

• The diagonal is the number itself. LCM(7, 7) = 7, because a number is already its own smallest multiple, and the panel prints the multipliers as (×1, ×1).
• Row 1 repeats the header. LCM(1, n) = n for every n, since 1 divides everything there is.
• Row 11 is the plain product in every column but its own: 11, 22, 33, 44, 55, 66, 77, 88, 99, 110, then 11 again at column 11, then 132. 11 is prime and shares no factor with anything else in the range, so nothing can be cancelled.
• Where one number divides the other, the answer is simply the larger. Row 12 reads 12, 12, 12, 12, 60, 12, 84, 24, 36, 60, 132, 12 — six of those twelve cells are just 12, because 1, 2, 3, 4, 6 and 12 all divide 12.
• Numbers sharing no factor give the product. LCM(7, 8) = 56, LCM(5, 9) = 45 and LCM(3, 10) = 30 are each a × b exactly, because the ÷ GCF step has nothing to remove when the GCF is 1.

The largest value anywhere in the grid is 132, at LCM(11, 12) — two numbers near the top of the range that share nothing. Off-diagonal cells dip lowest wherever one number swallows the other: LCM(2, 4) = 4 and LCM(3, 9) = 9 sit far below their neighbors, and row 1 sits lowest of all, because LCM(1, n) can never exceed n.

Nothing in the grid rises above a × b and nothing falls below the larger of the two inputs, which is the pair of bounds every cell has to satisfy. 132 sits exactly on the upper bound at 11 × 12; the 12 in row 12, column 6 sits exactly on the lower one.

LCM of Every Number From 1 to n

The other chart people come looking for is the running one: the smallest number divisible by everything up to n. It is catalogued as sequence A003418 in the On-Line Encyclopedia of Integer Sequences, described there as the least common multiple of {1, 2, ..., n}. The values below are this calculator's own answers for the same lists.

The sequence only moves when the next number brings a prime power that is not already accounted for. It stalls at 6 and again at 10, and it multiplies by a single prime at 5, 7 and 11. That is method two showing up as a pattern: the running answer is the product, over every prime up to n, of that prime's highest power not exceeding n — for n = 10 that is 2^3 × 3^2 × 5 × 7 = 2,520.

The ten-number cap is what stops the table at 11. Entering 1 through 11 is eleven values and returns Up to 10 numbers; dropping the 1 — which can never change an LCM — makes room, and 2 through 11 returns LCM = 27,720.

LCM Examples: The Numbers People Look Up

Past the 1-to-12 grid the searches cluster around a few dozen pairs, most of them multiples of 3, 4 and 5 met in fraction homework. Every LCM, GCF and multiplier below is this calculator's own output.

LCM of Common Pairs Above 12

Read down the multiplier column and a rule appears on its own. Wherever the pair reads (×3, ×2) the two numbers are in a 2 : 3 ratio — 12 and 18, 14 and 21, 20 and 30, 40 and 60, 48 and 72, 60 and 90 are all the same problem at different scales, and every one of them has an LCM of three times the smaller number.

The GCF column explains the size of each answer. 16 and 18 share only a 2, so their LCM climbs to 144 — exactly half of their 288 product. 48 and 72 share 24, so theirs lands on 144 as well, out of a product of 3,456: the same answer from numbers whose product is twelve times bigger, because twelve times as much was cancelled.

LCM of Three or More Numbers

The fold makes longer lists no harder to compute, though the answers grow less predictable. Ten values is the maximum this box accepts.

Two rows are worth pausing on. 2, 4, 8, 16 returns 16, because each number divides the next and the largest already contains all of them — its multiplier is ×1. And 5, 7, 11 returns 385, their full product, because three primes have nothing whatsoever in common to cancel.

Adding numbers to a list can never lower the answer, only raise it or leave it alone. 3, 4, 6, 8 returns 24 and adding a 12 would change nothing, since 12 already divides 24 — which is exactly what happened between 1 through 9 and 1 through 10 in the chart above.

LCM as the Least Common Denominator

Enter the denominators, read the LCM, and the multipliers hand you the rebuilt numerators. Each row below was worked that way.

Any common multiple would do the job; the least one simply keeps the numbers small. Add 1/4 + 1/6 over the product 24 instead and you get 6/24 + 4/24 = 10/24, which is perfectly correct and then has to be divided through by 2 to reach 5/12. Going in over the LCM lands on 5/12 with no reducing step at all.

Once the denominators match, the adding, subtracting and reducing can all be checked in the Fraction Calculator.

The multipliers do the rewriting for you. Enter 6, 10, 12 and the panel prints (×10, ×6, ×5), which are precisely the numbers each numerator has to be multiplied by: 1 × 10, 3 × 6 and 5 × 5 give the 10, 18 and 25 in the table.

LCM Examples in Timing and Alignment

The other family of problems asks when repeating things next coincide. Here the LCM answers when, and the multipliers answer how many cycles each side has run by then — usually the harder half of the question.

Knowing three machines resynchronize at 120 minutes is one fact. Knowing that by that moment the 8-minute machine will have completed 15 cycles, the 12-minute one 10 and the 20-minute one 6 is what a maintenance window is actually planned around, and it is sitting in the parentheses on the second line.

One caution on the packs row: the pack sizes are yours to supply. Packaging changes, and this page quotes none of its own — enter whatever is on the shelf in front of you and the arithmetic follows from that.

How to Read Your Result

There are no bands, zones or categories here, because an LCM is not a score. Reading the result means knowing what each of the four lines is for, and what the numbers in parentheses are actually telling you.

The Four Lines the Panel Returns

Enter 8, 12 and press Calculate. Under the heading Least Common Multiple these appear, in this order:

• The large readout: LCM = 24. The label travels with the number as one string, so the equals sign shows on screen.
• Numbers: 8, 12 — each divides 24 exactly (×3, ×2). The word Numbers sits in the left column, everything after the colon in the right.
• Method: LCM(a, b) = a × b ÷ GCF(a, b), folded across the list. Identical on every single result.
• Their GCF is 4 — the two travel together in fraction work (LCM for denominators, GCF for simplifying). This line has no left column, because it contains no colon for the panel to split on.
• Copy result, below the panel, puts all four lines on the clipboard as plain text. The two-column lines arrive with their halves butted together, so the second one copies as Numbers8, 12 — each divides 24 exactly (×3, ×2), with the colon gone.

Large answers pick up thousands separators and the multipliers do not. Enter 2, 3, 4, 5, 6, 7, 8, 9, 10 and the readout says LCM = 2,520 while the line beneath opens (×1260, ×840, ×630 …) — 1260 with no comma directly under 2,520 with one. The readout is formatted for reading; the multipliers are printed raw.

None of it is a bare number you have to interpret. If the LCM is all you came for it is the first line, and the three below exist so you can check it without leaving the page.

What the Multipliers in Parentheses Mean

Each ×n is the LCM divided by the number it sits beneath, printed in the order you typed them. Enter 9, 15, 21 and the panel returns LCM = 315 with (×35, ×21, ×15), so 9 × 35, 15 × 21 and 21 × 15 all come to 315.

That makes them the practical half of the answer in two settings. In fraction work each multiplier is the factor a numerator has to be scaled by to sit over the common denominator, turning 1/9, 1/15 and 1/21 into 35/315, 21/315 and 15/315. In timing work each is a cycle count — how many times that particular thing happens before everything lines up again.

A multiplier of ×1 is a signal in itself. It means that number already was the LCM, so every other value in your list divides it: 3, 5, 15 returns LCM = 15 with (×5, ×3, ×1), and the 15 was doing all the work on its own.

The GCF on the Last Line

The fourth line is a free extra — the greatest common factor of the whole list, folded down it with the same Euclid routine rather than lifted out of the LCM working. The two are separate calculations and can disagree about what was divided out along the way: 4, 6, 15 returns LCM = 60 with a GCF of 1, even though the fold itself divided by 2 at the first step and by 3 at the second. For a pair, though, the line earns its keep as a check, because the GCF and the LCM must multiply to the product of the two inputs.

A GCF of 1 tells you the numbers are coprime, and then the LCM is just the product, because the ÷ GCF step has nothing to take away: 3 and 5 give 15, 7 and 8 give 56, 11 and 13 give 143. The larger the GCF, the further the LCM falls below the product — 75 and 100 share 25, so 7,500 comes down to 300.

Watch that line whenever every number in your list looks divisible by something. 24, 36 and 60 all divide by 12 and the panel says so, which is advance warning that the answer will land far below the product — at 360 rather than 51,840.

The Two Messages That Replace an Answer

Both arrive in an amber box headed Check your inputs, and there are only two of them:

• “Enter two or more whole numbers, separated by commas” — the catch-all. It covers an empty box, a single number, anything non-numeric, a zero, a negative, and any decimal that is not a whole number.
• “Up to 10 numbers” — shown only when the list runs to eleven values or more.

Six inputs that look fine and are not: 4 on its own, because one number has no LCM to find; 4, 0, because the only common multiple of 4 and 0 is 0, and calling that the least is a convention rather than an answer; 4, -6, negatives being refused outright; 4.5, 6, which is not a whole number; 1,000, 4, read as 1, 000 and 4; and 4;6, because a semicolon is not a separator here.

Three that look wrong and work fine: 4 6 with spaces and no comma at all, 4, 6, with a trailing comma left dangling, and 4, 6.0 — 6.0 is a whole number written the long way, so it passes. Commas and whitespace are interchangeable, and repeats are legal too: 6, 6, 6 returns LCM = 6.

Limits: When This Calculator Does Not Apply

It does one job — the least common multiple of two to ten positive whole numbers. These are the edges of that job, including one place where the arithmetic itself stops being exact.

• Positive whole numbers only. Zero, negatives and decimals are all refused with the same message, so there is no LCM of 4.5 and 6 to be had here and no fractional answer of any kind.
• Two values minimum, ten maximum. One number has no LCM to find; an eleventh returns Up to 10 numbers, which is why the 1-to-11 run in the chart above had to drop its 1.
• Commas and spaces separate, and nothing else does. A semicolon is rejected, and a thousands separator inside a number splits it in two — 1,000 becomes 1 and 000.
• The answer is exact only while every intermediate product — the running LCM multiplied by the next number, before the division — stays at or below JavaScript's safe integer limit of 9,007,199,254,740,991. Two inputs of 94,906,265 or less can never breach it, so anything in that range is exact. Above it the last digits drift: 123456789 and 987654321 return 13,548,070,123,626,140 where the true LCM is 13,548,070,123,626,141, and the multipliers give it away by printing as decimals, ×109739368.99999999 instead of a whole number.
• Clean multipliers are not proof of a clean answer, though, so the drift cannot be ruled out by eye. 999999937 and 999999893 return 999,999,830,000,006,800 with whole-number multipliers of ×999999893 and ×999999937, against a true LCM of 999,999,830,000,006,741. Nor does a short answer mean a safe one: 99999999 and 100000001 return 10,000,000,000,000,000 where the truth is 9,999,999,999,999,999. Above the 94-million mark, check the result somewhere with exact big-integer arithmetic.
• It finds the LEAST common multiple, not any common multiple. If your problem needs a shared multiple that also satisfies some further condition, this is only the starting point — the rest of the set is 2×, 3×, 4× the answer and onward.
• No prime factorization is shown. The panel gives the LCM and the GCF, never the primes the school method would have used to get there.
• No working is shown either. There is no listed-multiples trace and no fold displayed step by step, only the finished number with its multipliers.
• It handles numbers, not algebra. The least common multiple of 6x²y and 15xy³ — a real question in rational-expression work — is outside what this page does.
• The GCF on the last line covers the whole list, but the GCF × LCM = product check only holds for a pair. With three or more inputs it is information, not a verification.
• Repeated values are accepted and simply absorbed. 6, 6, 6 returns 6, which is correct but rarely what someone meant to ask.

The primes that method two relies on are not printed anywhere on this page, but any one of your numbers can be broken down into them in the Factor Calculator.

One apparent limit is not one. Size barely affects speed, because Euclid's algorithm works on remainders rather than on the numbers themselves — a nine-digit pair resolves as fast as a single-digit pair. The ten-number cap is a decision about a usable input box, not a boundary of the arithmetic.