Skip to main content
    UnitConvertLab logo

    LCM & GCF Calculator

    Find the Least Common Multiple (LCM) and Greatest Common Factor (GCF/GCD) of two or more integers.

    LCM

    72

    GCF / GCD

    6

    For 12, 18, 24: LCM × GCF ÷ product identity holds for pairs. Uses the Euclidean algorithm.

    How it works

    The Greatest Common Factor (GCF), also called Greatest Common Divisor (GCD), is the largest positive integer that divides every number in the set. The Least Common Multiple (LCM) is the smallest positive integer that is a multiple of every number in the set.

    This calculator uses the Euclidean algorithm to compute GCF, then derives LCM using lcm(a,b) = |a·b| / gcd(a,b), iteratively extended across the full list.

    Cite this page

    UnitConvertLab. (2026). LCM & GCF Calculator. UnitConvertLab. Retrieved from https://unitconvertlab.com/fr/tools/lcm-calculator