GCD & LCM Calculator

Greatest common divisor and lowest common multiple of any numbers.

GCD (highest common factor)
12
LCM (lowest common multiple)
360
Numbers
3
Product
51,840
Show the working
  1. 1GCD of 24, 36, 60 = 12 (Euclid's algorithm)
  2. 2LCM = product ÷ GCD chain = 360
Formula
GCD via Euclid; LCM = a ÷ gcd(a,b) × b

How it works

The greatest common divisor and lowest common multiple of a list of whole numbers.

Example

gcd(24, 36, 60) = 12 and lcm = 360.

About the GCD & LCM Calculator

Greatest common divisor and lowest common multiple of any numbers. It sits in the Math & Algebra section of NWS Calc, a free collection of calculators that run entirely in your browser. There is no signup, no paywall and no tracking — open the page, enter your numbers, get an answer.

Frequently asked questions

Is the GCD & LCM Calculator free to use?
Yes. Every calculator on NWS Calc is completely free, with no signup, no usage limits and no ads.
Does my data leave my device?
No. The GCD & LCM Calculator runs entirely in your browser using JavaScript. Nothing you type is uploaded, logged or stored on a server.
Can I use the GCD & LCM Calculator on my phone?
Yes. The page is fully responsive and works in any modern mobile or desktop browser — there is nothing to install.
What else is in Math & Algebra?
Equations, fractions, primes, roots, sequences and number theory. You can browse the full Math & Algebra category for related calculators.

Related calculators