Find the greatest common factor and least common multiple of two or more integers, with prime factorizations and the product of all values. Free and instant.

Enter two or more positive whole numbers, separated by commas or spaces.
GCF (HCF)
LCM
Count
Product of all
Prime factorization
The GCF is found with the Euclidean algorithm; the LCM is computed pairwise as product ÷ GCF. Only positive whole numbers are used.

Add this free tool to your own website — copy and paste the code below.