Skip to content
browserutils

GCD & LCM Calculator

Calculate greatest common divisor and least common multiple

GCD & LCM Calculator is a free online tool from BrowserUtils that calculate greatest common divisor and least common multiple. It runs entirely in your browser — your data never leaves your device. No account required.

6
36
Numbers: 12, 18

How to use GCD & LCM Calculator

  1. 1 Paste or type your input into the editor above.
  2. 2 The tool processes your data instantly — right in your browser, with nothing sent to a server.
  3. 3 Copy the result with one click or continue editing your input.

About GCD & LCM Calculator

Free online GCD and LCM calculator. Find the greatest common divisor and least common multiple of two or more numbers using the Euclidean algorithm. This tool runs entirely in your browser — your data is never sent to a server. Just paste your input, get instant results, and copy with one click. No sign-up or installation required.

GCD & LCM Calculator specs

Runtime
100% client-side (browser)
Cost
Free — no account, no rate limits, no usage caps
Browser support
Chrome 90+, Firefox 88+, Safari 14+, Edge 90+
Part of
299 developer tools on BrowserUtils (100% client-side)

Questions

What is the Euclidean algorithm?
The Euclidean algorithm finds the GCD of two numbers by repeatedly dividing the larger by the smaller and taking the remainder, until the remainder is zero. The last non-zero remainder is the GCD.
How are GCD and LCM related?
For any two positive integers a and b: LCM(a, b) = (a × b) / GCD(a, b). This relationship makes it efficient to compute both values together.
Can I calculate GCD for more than two numbers?
Yes. The GCD of multiple numbers is found by computing the GCD of the first two, then computing the GCD of that result with the next number, and repeating until all numbers are processed.
What does it mean if the GCD of two numbers is 1?
If GCD(a, b) = 1, the numbers are coprime (relatively prime). They share no common factors other than 1. For example, 8 and 15 are coprime because GCD(8, 15) = 1.
Does the GCD and LCM calculator work offline?
Yes. The Euclidean algorithm runs entirely in your browser. No data is sent anywhere, and you can use the tool without an internet connection.
Embed this tool

Copy this code to embed the tool on your website. Adjust the height to fit your layout.

<iframe src="https://www.browserutils.dev/embed/gcd-lcm-calculator" width="100%" height="500" frameborder="0" title="GCD & LCM Calculator"></iframe>

Related tools

More Math & Calculators

View all Math & Calculators tools