LCM Calculator

Enter two or more whole numbers. Review the LCM, prime factorizations, the required highest prime powers, and the two-number identity LCM(a,b)×GCF(a,b)=|ab| where applicable.

Integers

Enter at least two whole numbers. If any value is zero, the LCM is zero.

Prime factorizations

Cross-check

LCM(a,b) × GCF(a,b) = |a×b|

For more than two values, the LCM is built iteratively from exact pairwise LCMs.

Represent → compare → factor → verify

Equivalent fraction forms should preserve the same rational value, and number-theory relationships should agree across factors, remainders, GCF, multiples, and prime structure. Use the connected tools to verify rather than relying on an isolated answer.

How to use this LCM Calculator

Enter two or more whole numbers. Review the LCM, prime factorizations, the required highest prime powers, and the two-number identity LCM(a,b)×GCF(a,b)=|ab| where applicable.

Exact integer work

Find the least common multiple of two or more integers with exact arithmetic, prime-factor coverage, and a GCF cross-check.

Large inputs

The GCF/LCM result uses exact integer arithmetic. Prime-factor detail is shown only through 10 trillion per input so a very large factorization cannot stall the browser; 0 and ±1 are labeled explicitly because their prime-factor behavior is special.