GCD & LCM Calculator

Find the greatest common divisor and least common multiple of numbers.

Support
Works Offline
Privacy First
No Login
No API

Numbers

Enter two or more positive integers

Results

GCD
12
LCM
360

About the GCD & LCM Calculator

Enter two or more positive integers to instantly compute their greatest common divisor (GCD) and least common multiple (LCM) using the Euclidean algorithm.

Examples

GCD/LCM of 24, 36, 60

24, 36, 60

Output

GCD: 12, LCM: 360

Keyboard shortcuts

  • Copy the main outputCtrl / ⌘ + Shift + C
  • Download the resultCtrl / ⌘ + S
  • Share this toolCtrl / ⌘ + Shift + S
  • Reset the inputsAlt + R
  • Open the tool search paletteCtrl / ⌘ + K

Related tools

Frequently asked questions

Comments

No login needed. Comments appear after a quick review.

Protected by an on-site captcha — no third-party trackers.

Optional: get an alert when your comment is published or replied to, plus new tool announcements. No sign-up.

Loading comments…

Version 1.0.0 · Updated 2026-08-07 · Runs entirely in your browser