LCM & GCD Calculator
Find the Least Common Multiple and Greatest Common Divisor of multiple numbers with prime factorization.
3 numbers: 12, 18, 24
GCD / HCF
Greatest Common Divisor
6
LCM
Least Common Multiple
72
Prime Factorizations
12=2^2 × 3
18=2 × 3^2
24=2^3 × 3
Euclidean Algorithm (first two: 12, 18)
GCD(12, 18) uses repeated division: larger ÷ smaller, take remainder, repeat until 0.
GCDLCMHCFPrime FactorizationEuclidean Algorithm
Calculate the Least Common Multiple (LCM) and Greatest Common Divisor (GCD) of up to ten numbers at once, with prime factorization and Euclidean algorithm steps.
Key Features
Multi-Number Support
Find LCM and GCD of 2–10 numbers simultaneously by reducing over the array.
Prime Factorization
Shows the prime factorization of each input number in exponential notation.
Euclidean Steps
Expandable step-by-step Euclidean algorithm for the GCD calculation.
Relationship Verification
For two numbers, verifies GCD × LCM = a × b.
Overflow Detection
Detects when LCM exceeds 10¹⁵ and shows a friendly message instead of a corrupted result.
How to Use
- 1Enter at least two positive integers.
- 2LCM and GCD are computed instantly.
- 3Expand the Euclidean steps or prime factorization for detailed working.