LCM & GCD (HCF) Calculator
Least Common Multiple & Greatest Common DivisorStep-by-Step Mathematical Steps
Loading steps...
Result Summary
Least Common Multiple (LCM)
LCM = 360
Smallest common multiple divisible by all numbers
Greatest Common Divisor (GCD / HCF)
GCD = 12
Highest common factor that divides all numbers
Prime Factorizations:
24 = 2³ × 3
36 = 2² × 3²
60 = 2² × 3 × 5
36 = 2² × 3²
60 = 2² × 3 × 5
Frequently Asked Questions
For any two positive integers
a and b:LCM(a, b) × GCD(a, b) = a × b → LCM(a, b) = (a × b) / GCD(a, b).
The Euclidean Algorithm repeatedly divides the larger number by the smaller number and replaces the larger number with the remainder until the remainder becomes 0. The last non-zero divisor is the GCD.