GCD/LCM Calculator
Find the Greatest Common Divisor and Least Common Multiple of two or more numbers with detailed steps
GCD (Greatest Common Divisor)
6
LCM (Least Common Multiple)
36
Euclidean Algorithm
12 = 0 × 18 + 12
18 = 1 × 12 + 6
12 = 2 × 6 + 0
GCD = 6
Prime Factorization
12 = 2² × 3
18 = 2 × 3²
How to Use This Tool
Enter two or more positive numbers using the input fields.
Click "Add Number" to include additional numbers.
View the GCD (Greatest Common Divisor) and LCM (Least Common Multiple).
See the step-by-step Euclidean algorithm and prime factorizations.
About This Tool
GCD/LCM Calculator finds the Greatest Common Divisor and Least Common Multiple of two or more numbers. For two numbers, it shows the step-by-step Euclidean algorithm. Prime factorizations of each input are displayed with superscript exponents. Supports any number of inputs — add as many fields as you need.
Share This Tool
Related Tools
Scientific Calculator
Full-featured scientific calculator with trigonometry, logarithms, exponents, and memory functions
Binary Calculator
Perform addition, subtraction, multiplication, and bitwise operations on binary numbers with decimal conversion
Prime Number Checker
Check if any number is prime, find its factors, and discover the nearest prime numbers above and below
Factorial Calculator
Calculate factorials, permutations, and combinations for any number with step-by-step computation