LCM Calculator

The LCM Calculator finds the smallest positive number divisible by every entered integer. Least common multiples are useful for common denominators, repeating schedules, gear cycles, and events that must align.

LCM as a common denominator

Prime factorization builds the LCM from every required prime at its highest exponent. For two nonzero integers, LCM(a,b)=|ab|/GCF(a,b). The GCF should be divided before multiplying when large values might overflow.

For nonzero integers a and b, LCM(a,b) = |ab| / GCF(a,b).

Enter the values in their mathematical roles

Enter whole numbers and include every value that must divide the result. Negative signs are ignored for the positive LCM. If any input is zero, many conventions return zero because no positive multiple condition can be satisfied in the usual way.

The governing relationship

For nonzero integers a and b, LCM(a,b) = |ab| / GCF(a,b).

A compact example

GCF(12,18)=6, so LCM(12,18)=216/6=36.

Valid inputs and boundary cases

Do not enter rounded decimals as integers. Duplicate values do not change the answer, and a number that already divides another entry adds no new factor. Multi-number problems can be solved pair by pair.

Read the answer in context

The LCM is commonly taken as a nonnegative value and is useful for common denominators and repeating schedules.

An independent check

Divide the proposed LCM by every original input. Each quotient should be whole. A smaller common multiple would fail at least one division, and the prime factorization should contain the highest exponent required by each number.

Errors that change the answer

• Choosing the largest input without checking divisibility
• Using lowest instead of highest prime exponents
• Confusing LCM with GCF
• Dropping one value from a list
• Applying the two-number product formula without the GCF

Continue with a related calculator

Continue with the GCF Calculator or Prime Factorization Calculator. For everyday arithmetic and order-of-operations checks, use the Basic Calculator.

What this numerical result cannot decide

LCM describes exact integer cycles. Real schedules can include delays, calendar exceptions, tolerances, or noninteger periods that require a different model.

A second way to understand the method

To add 5/12 and 7/18, the LCM of 12 and 18 is 36. Rewrite the fractions as 15/36 and 14/36, then add to get 29/36. Using the LCM keeps the intermediate denominator as small as possible.

Synchronizing repeating events

If one signal repeats every 12 seconds and another every 18 seconds, both return together after LCM(12,18)=36 seconds, assuming they start together. If their starting times differ, the LCM alone is not enough; the phase offset must also be included in the schedule.

Prime powers explain the result

For 24=2³×3 and 90=2×3²×5, the LCM takes 2³, 3², and 5, giving 360. Using the highest exponent guarantees the result contains every input’s required factors. Taking only shared factors would instead move toward the GCF, which answers a different question.

Finding the LCM of several values

Combine values in stages: LCM(6,8)=24, then LCM(24,15)=120. Verify 120÷6=20, 120÷8=15, and 120÷15=8. The order of pairwise combination does not change the final result. This approach is especially useful when one later number introduces a new prime factor.

When zero appears

Many elementary conventions define the LCM of zero and a nonzero integer as zero, while “least positive common multiple” language can create ambiguity because zero is not positive. Follow the definition required by the course, software, or specification and state it when the distinction matters.

LCM FAQ

What is the LCM of coprime numbers?

Their product, because they share no prime factors.

Can the LCM equal the largest input?

Yes, when every other input divides that largest number.

How are GCF and LCM related?

For two nonzero integers, their product in absolute value equals GCF×LCM.

For additional worked mathematics, see the free OpenStax Prealgebra 2e reference.