12
GCD (Greatest Common Divisor)
144
LCM (Least Common Multiple)
Step-by-step (Euclidean Algorithm)
Common Factors
Prime Factorization
GCD vs LCM
- GCD — largest number that divides all inputs evenly
- LCM — smallest number that is a multiple of all inputs
- Relationship — GCD(a,b) × LCM(a,b) = a × b
Want to learn more?
Read the complete guide with examples and tips