GlobalFree to use

GCD and LCM calculator

Find the greatest common divisor and least common multiple of two or more whole numbers, of any size.

Your inputs stay in this tab. We do not receive your files, pasted text or calculation values.

Input

Your result

Your result will appear here.

How to use this tool

  1. Enter your values or choose a local file. Replace the example data with your own.
  2. Review options, units and assumptions, then run the tool.
  3. Check the result before copying or downloading it. Keep an original copy of important files.

Method & assumptions

Find the greatest common divisor and least common multiple of two or more whole numbers, of any size.

Euclid: gcd(a, b) = gcd(b, a mod b); lcm(a, b) = |a × b| ÷ gcd(a, b)

Worked example

Whole numbers separated by commas or spaces: 84, 126, 210

→ Greatest common divisor (GCD): 42
→ Least common multiple (LCM): 1,260
→ Coprime: No

Limits & important notes

Basic release. Review the result before relying on it. File limits, supported cases and processing requirements are shown above.

Content updated:

Privacy & Free to use

Are my inputs stored?

Your inputs stay in this tab. We do not receive your files, pasted text or calculation values.

Is this tool free?

Yes. No signup or payment is required.

Processed in your browser

Useful next steps