GCF and LCM Calculator
Find the Greatest Common Factor (GCF/GCD) and Least Common Multiple (LCM) of two integers.
Highest integer dividing both 48 and 180
Smallest integer multiple of both 48 and 180
GCF (Greatest Common Factor) & LCM Mathematics
GCF and LCM calculator finds the Greatest Common Factor and Least Common Multiple of two integers using the Euclidean algorithm.
The Euclidean algorithm finds the GCF by repeatedly replacing the larger number with the remainder of dividing it by the smaller, until the remainder is zero. The LCM is then derived directly from the GCF.
- 1Enter two integers.
- 2View their Greatest Common Factor (GCF/GCD) and Least Common Multiple (LCM).
Find the GCF and LCM of 48 and 180.
Frequently Asked Questions (FAQ)
The fastest method is the Euclidean algorithm: repeatedly replace the larger number with the remainder of dividing it by the smaller number, until the remainder reaches zero — the last nonzero remainder is the GCF.
Once you know the GCF, LCM = (A × B) / GCF — for 48 and 180 with a GCF of 12, LCM = (48 × 180) / 12 = 720.
Top Similar Tools (Math)
Explore more tools in Math (83+ more calculators available)
Browse our complete directory with category filters, formulas, and verified engines.