How to use the GCF & LCM Calculator
- Enter two or more whole numbers separated by commas or spaces.
- Read the GCF and LCM.
How it works
GCF uses Euclid's algorithm repeatedly: gcd(a, b) = gcd(b, a mod b). LCM uses lcm(a, b) = |a × b| ÷ gcd(a, b), applied across the list.
Worked examples
12, 18, 24
GCF = 6 and LCM = 72.
Limitations and assumptions
- Very large LCMs beyond 2^53 can't be shown exactly.
Frequently asked questions
Is GCF the same as GCD and HCF?
Yes — greatest common factor, greatest common divisor and highest common factor are the same thing.
G
Built and reviewed by Guru G
Calculation logic is covered by automated tests against known values. Last reviewed Nov 6, 2026. Found a problem? Let us know — see our editorial policy.