🔗 LCM Calculator
Lcm Calculator
The least common multiple is the smallest number both integers divide into evenly — essential for adding fractions with different denominators or syncing repeating schedules. The shortcut: LCM(a,b) = |a×b| / GCD(a,b).
Enter two integers. The calculator finds their greatest common divisor with Euclid's algorithm, then the LCM, so you see both useful numbers at once.
How to use this calculator
Type two integers and press Calculate to get their least common multiple.
- Type the first integer into the First integer field.
- Type the second integer into the Second integer field.
- Press Calculate and read the LCM as the headline result.
- Check the GCD shown underneath; the calculator uses it to find the LCM.
Worked example: LCM of 12 and 18 by prime factorization
This is the working the calculator shows for your numbers:
Step 1 — factor each number: 12 = 2² × 3; 18 = 2 × 3²
Step 2 — take every prime at its highest power seen anywhere: 2² (from the 12) and 3² (from the 18)
Step 3 — multiply: 2² × 3² = 4 × 9 = 36
Check: 36 ÷ 12 = 3 and 36 ÷ 18 = 2, and nothing smaller is divisible by both.
The rule to remember: for the LCM you take the maximum power of each prime — the opposite instinct from the GCF, which takes the minimum. (Our GCF calculator shows the twin working.)
What is the least common multiple?
The smallest positive number that both integers divide into evenly. The LCM of 4 and 6 is 12, because 12 is the first number appearing in both multiplication tables.
The smallest meeting point of two rhythms
The least common multiple of two numbers is the smallest number that is a multiple of both — the first point where their rhythms coincide. Buses leaving every 12 and every 18 minutes depart together every LCM(12, 18) minutes; gears, tiles and timetable problems all reduce to the same question.
The same answer by the ladder method
Write 12 and 18 in a row and keep dividing both by any common prime, bringing down whatever does not divide:
2 | 12 18 3 | 6 9 | 2 3
Nothing divides both 2 and 3, so stop. The LCM is the L-shaped product: 2 × 3 × 2 × 3 = 36. The ladder is slower to explain but faster by hand for big lists, which is why both methods live here.
Worked example: more than two numbers
LCM(4, 6, 10): factor them — 4 = 2², 6 = 2 × 3, 10 = 2 × 5. Highest powers: 2², 3, 5 → 4 × 3 × 5 = 60. Paste the whole list into the one field; the method works unchanged however many numbers you bring. For three larger ones — 12, 18 and 20 — the same working gives 2² × 3² × 5 = 180.
Frequently asked questions
What is the LCM of 12 and 18?
36. By prime factorization: 12 = 2² × 3 and 18 = 2 × 3²; take the highest power of each prime (2² and 3²) and multiply: 36. The ladder method in the worked example reaches the same answer by repeated division.
Can I find the LCM of three or more numbers at once?
Yes — the input now takes a whole comma-separated list. LCM(4, 6, 10) = 60 and LCM(12, 18, 20) = 180, each worked by the same highest-powers rule. Previously the tool was capped at two numbers; every serious rival already accepted lists.
What is the difference between the LCM and the GCF?
They are mirror images. The GCF is the largest number that divides both of yours (take the lowest power of each shared prime); the LCM is the smallest number that both of yours divide into (take the highest power of every prime). For two numbers they are linked: LCM × GCF = the product of the two numbers.
Which method should I choose — prime factorization, listing, or ladder?
Prime factorization explains why the answer is what it is and scales to any list. Listing multiples is fine for two small numbers. The ladder is the quickest pencil method for several numbers at once. The calculator shows the working for whichever you pick — the steps are the point, not just the answer.
Does the LCM work with decimals?
Yes, with a scaling step: 1.2 and 1.5 are scaled by 10 to 12 and 15, whose LCM is 60, then scaled back to 6.0. The calculator does this automatically and notes it in the result, since "multiple" is strictly a whole-number idea being extended carefully.







































