Find the greatest common divisor (GCD, also called the highest common factor) and the least common multiple (LCM) of a set of whole numbers. Enter two or more integers separated by commas or spaces and the calculator returns both values. The GCD is the largest number that divides all of them evenly, which is exactly what you need to reduce fractions or split things into equal groups. The LCM is the smallest number they all divide into, useful for adding fractions or finding when repeating cycles line up. The calculation uses the fast Euclidean algorithm and extends cleanly to any number of inputs. Enter your integers and both results appear instantly, computed locally in your browser.
It uses the Euclidean algorithm, repeatedly taking remainders until it reaches the greatest common divisor.
The least common multiple equals the product of the numbers divided by their GCD, extended across the whole list.
Yes. It computes the GCD and LCM of two or more integers by combining them pairwise.
Find the greatest common divisor (GCD, also called the highest common factor) and the least common multiple (LCM) of a set of whole numbers. Enter two or more integers separated by commas or spaces and the calculator returns both values.
Yes. GCD / LCM Calculator is completely free, with no sign-up and no usage limits.
Yes. GCD / LCM Calculator runs in any modern web browser. There is nothing to download or install.
Yes. GCD / LCM Calculator runs entirely on your device in your browser, so nothing you enter is uploaded to a server.
Link this tool from a README, doc or site. The badge links back to this page.
[](https://yourhack.ai/gcd-lcm-calculator)