GCF & LCM Calculator
Find the greatest common factor (GCF/GCD) and least common multiple (LCM) of two or more numbers, with prime factorization and Euclid's algorithm
Enter 2 or more whole numbers separated by commas or spaces. Very large numbers are fine.
Greatest common factor (GCF / GCD)
Least common multiple (LCM)
Prime factorization method
Euclid's algorithm (step by step)
GCF is also called the greatest common divisor (GCD) or highest common factor (HCF). Negative numbers use their absolute value; the GCF of a number and 0 is the number itself, and any LCM with 0 is 0.