GCD and LCM calculator
Find the largest shared divisor and smallest shared multiple of two whole numbers. Use the GCD to simplify ratios and the LCM to compare repeating intervals. Integer arithmetic keeps the answer exact.
Free to use. No email or account required.
Your inputs
The editable example is illustrative. Enter your own dimensions, operating data, prices, and fees. Results update as you edit.
Calculations run in your browser. Inputs are not saved or sent to analytics.
How it works
- Least common multiple = ( × ) ÷ Greatest common divisor
- Worked example
- 48, 18 → GCD = 6; LCM = 144
Input and formula key
Your result
Complete the inputs to see your result.
Assumptions and limitations
Inputs are integers from 0 to 1,000,000,000. Euclid’s algorithm repeatedly replaces a pair with divisor and remainder. This tool uses GCD(0,0)=0 and LCM(a,0)=0 as computational conventions; the pair (0,0) has no greatest positive common divisor in the usual definition.
Sources
- Python documentation — gcd and lcm definitions and zero conventions Sources reviewed: 2026-10-28
Processing and privacy
The calculation or transformation runs in your browser. The tool does not send its input values or generated output to an application server. Loading a page still makes infrastructure requests; optional analytics and Google consent messages have separate controls.
Privacy Policy. Privacy & preferences in the footer controls optional analytics.
Sources and maintenance
Maintained by emonster. Sources are listed with their own review dates; these are not live-data timestamps or claims of independent expert certification.
