πŸ› οΈ

πŸ”’GCD & LCM Calculator

Free online GCD and LCM calculator. Greatest common divisor and least common multiple of multiple numbers with steps.

Input Numbers

Only positive integers are accepted. Zero, negative, and non-integer values will be skipped.

Results

GCD (Greatest Common Divisor)
6
LCM (Least Common Multiple)
144
Euclidean Algorithm Steps β€” gcd(48, 18)
48 = 2 Γ— 18 + 12
18 = 1 Γ— 12 + 6
12 = 2 Γ— 6 + 0
β†’ gcd = 6
Prime Factorization
48 =2⁴ Γ— 3
18 =2 Γ— 3Β²

About GCD & LCM Calculator

The GCD & LCM Calculator finds the greatest common divisor and least common multiple of any number of integers, with BigInt support for very large values. It also shows the prime factorization of each number using Unicode superscripts and walks through the Euclidean algorithm step by step. Everything runs locally in your browser.

Features

  • GCD of multiple numbers
  • LCM of multiple numbers
  • Prime factorization with Unicode superscripts
  • Step-by-step Euclidean algorithm
  • BigInt support for very large numbers

Frequently Asked Questions

How many numbers can I enter?
Any count. Separate the numbers with commas and the tool will compute GCD and LCM across all of them.
What is GCD?
GCD stands for greatest common divisor β€” the largest integer that divides every input number without a remainder.