Calculate Greatest Common Divisor and Least Common Multiple of multiple numbers. Shows prime factorization and common divisors.
Find the greatest common divisor (GCD) and least common multiple (LCM) of two or more integers. Results appear instantly along with the prime factorizations used to compute them.
Initializing in your browser…
You need the greatest common divisor and least common multiple of 48 and 180 for a fraction-reduction step.
Numbers
48 and 180
Result
GCD = 12 LCM = 720 (48 = 2⁴·3, 180 = 2²·3²·5)
From the prime factorisations, GCD takes the lowest shared powers (2²·3 = 12) and LCM the highest (2⁴·3²·5 = 720), and indeed GCD × LCM = 48 × 180. Showing the factorisation makes the relationship between the two results clear instead of magical.
Find the greatest common divisor (GCD) and least common multiple (LCM) of two or more integers. Results appear instantly along with the prime factorizations used to compute them.
Yes. The tool computes GCD and LCM across any number of inputs by iterating pairwise.
For two numbers a and b: GCD(a, b) × LCM(a, b) = a × b.
Every calculation runs locally in your browser. Your numbers and expressions are not transmitted or stored.