🔢 GCF and LCM Calculator: Find the Greatest Common Factor and Least Common Multiple

What is the GCF and LCM Calculator?

The greatest common factor (GCF), also called the greatest common divisor (GCD) or the highest common factor (HCF) in British and Indian textbooks, is the largest whole number that divides evenly into every number in your list. The factors shared by 12 and 18 are 1, 2, 3, and 6, so the GCF is 6. The single most common use is reducing a fraction to lowest terms: dividing the top and bottom of 12/18 by 6 gives 2/3. Any smaller common factor would still leave the fraction reducible, which is why you want the greatest one rather than just any shared factor.

The least common multiple (LCM) is the smallest positive whole number that every number in your list divides into evenly. The multiples of 4 are 4, 8, 12, 16, and so on, while the multiples of 6 are 6, 12, 18, 24. The first value they share is 12, so the LCM of 4 and 6 is 12. The LCM is what you need to find a common denominator when adding or subtracting fractions, and it is also called the lowest common denominator (LCD) when the numbers involved are denominators. Note that the LCM is not always the product: 4 x 6 = 24 is a common multiple, but it is not the least one.

There are three standard hand methods, and this calculator agrees with all of them. Listing method: write out the factors (or multiples) of each number and pick the biggest shared factor (or the smallest shared multiple). It is intuitive but slow past two-digit numbers. Prime factorization method: break each number into primes, then take each shared prime raised to its lowest power for the GCF, and each prime that appears anywhere raised to its highest power for the LCM. With 12 = 2^2 x 3 and 18 = 2 x 3^2, the GCF is 2^1 x 3^1 = 6 and the LCM is 2^2 x 3^2 = 36. Ladder method (also called the cake or box method): divide the whole row by a common prime, write the quotients underneath, and repeat. The GCF is the product of the divisors down the left side, and the LCM is that product times everything left in the bottom row.

Internally the tool uses the Euclidean algorithm rather than factoring, because factoring large numbers is slow while Euclid is nearly instant. The algorithm repeatedly replaces the pair (a, b) with (b, a mod b) until b reaches zero, at which point a is the GCD. It then computes the LCM from the identity lcm(a, b) = a x b / gcd(a, b), which follows because every prime in the product is counted exactly once between the two results. For a list of three or more values, both operations are folded pairwise: gcd(a, b, c) = gcd(gcd(a, b), c), and the same associativity holds for the LCM. This is why a GCF and LCM calculator can handle a dozen numbers as fast as two.

A few boundary rules are worth knowing because they trip people up and because different textbooks state them differently. If two numbers share no factor beyond 1 they are called coprime or relatively prime, so the GCF is 1 and the LCM is simply their product: gcf(7, 11) = 1 and lcm(7, 11) = 77. If one number divides the other, the GCF is the smaller number and the LCM is the larger: gcf(6, 18) = 6 and lcm(6, 18) = 18. The GCF of any number with itself is that number. By convention gcd(n, 0) = n, since every number divides zero, but the LCM with zero is undefined or zero depending on the source, which is why this calculator ignores zeros rather than guessing. Decimals and negative signs are also stripped, because both the GCF and the LCM are defined for positive whole numbers.

The relationship GCF x LCM = a x b is one of the most useful shortcuts in the topic, and also one of the most misapplied. It is exactly true for two numbers, so if a test question tells you the GCF of two numbers is 6 and their LCM is 36, you know their product is 216, which narrows the candidates to 6 and 36 or 12 and 18. It is false for three or more numbers: gcf(12, 18, 24) x lcm(12, 18, 24) = 6 x 72 = 432, while the product of the three numbers is 5184. Use the pairwise fold instead, which is exactly what this calculator does for every input beyond two values.

When to use it

• Reducing a fraction to lowest terms by dividing the numerator and denominator by their GCF, for example 42/56 with a GCF of 14 becomes 3/4.
• Finding the lowest common denominator when adding or subtracting fractions, which is the LCM of the denominators.
• Checking GCF and LCM homework answers before you submit, and seeing which of the two you swapped when they disagree.
• Working out when two repeating events line up again, such as buses arriving every 12 and 18 minutes both leaving together after 36 minutes.
• Splitting two quantities into the largest possible equal groups, such as 24 pencils and 36 erasers packed into 12 identical kits.
• Simplifying a ratio, since dividing every term of 18:24:30 by the GCF of 6 gives the equivalent ratio 3:4:5.

How to use the GCF and LCM Calculator

1. Type two or more whole numbers, separated by commas, spaces, or new lines. There is no upper limit on how many you enter.
2. Read the GCF (greatest common factor) and the LCM (least common multiple) shown straight away. No submit button is needed.
3. Check the count of numbers used to confirm the tool read every value you pasted.
4. Use one of the example buttons to load a sample set, or Clear to start over.
5. Decimals, negative signs, and zeros are handled automatically, since only positive whole numbers are used in the calculation.

Formula & method

Worked examples

GCF and LCM for the number pairs that come up most in homework

Which method to use, and when

Prime factorization of common numbers, for the factorization method

Common mistakes to avoid

• Mixing up the GCF and the LCM. The GCF is never larger than the smallest number you entered, and the LCM is never smaller than the largest. If your answer breaks that rule you have swapped them. A quick sanity check on 12 and 18: any answer above 12 cannot be the GCF, and any answer below 18 cannot be the LCM.
• Assuming GCF times LCM equals the product for three or more numbers. The identity GCF x LCM = a x b holds only for exactly two numbers. For 12, 18, and 24 the GCF is 6 and the LCM is 72, giving 432, while the product of the three numbers is 5184. With three or more values, fold the GCF and the LCM pairwise across the list, as this tool does.
• Taking the highest power of shared primes for the GCF. In the prime factorization method the GCF uses the lowest power of each shared prime and the LCM uses the highest power of every prime present. For 12 = 2^2 x 3 and 18 = 2 x 3^2, the GCF is 2^1 x 3^1 = 6, not 2^2 x 3^2 = 36. Reversing the two rules is the single most common factorization error.
• Assuming the LCM is always the product of the numbers. The LCM equals the product only when the numbers are coprime. For 4 and 6 the product is 24 but the LCM is 12, because they share a factor of 2. Multiplying denominators always gives a common denominator, but often not the lowest one, which leaves you extra reducing to do.
• Forgetting that coprime numbers have a GCF of 1. When two numbers share no factor other than 1, such as 7 and 11 or 15 and 28, the GCF is 1 and the LCM is their product. A GCF of 1 is a valid answer, not a sign the calculator failed. It means the fraction is already in lowest terms.
• Including zero or decimals in the list. Zero is a multiple of every number, so it has no meaningful LCM with other values, and the GCF and LCM are defined only for positive whole numbers. This tool ignores zeros, decimals, and negative signs so the result stays well defined rather than returning a misleading number.

Glossary

Greatest common factor (GCF)

The largest whole number that divides evenly into every number in a set. Also called the greatest common divisor (GCD) or, in British and Indian textbooks, the highest common factor (HCF).

Least common multiple (LCM)

The smallest positive whole number that every number in a set divides into evenly. Also called the lowest common multiple.

Lowest common denominator (LCD)

The LCM of the denominators of two or more fractions. It is the smallest denominator you can rewrite them all over before adding or subtracting.

Euclidean algorithm

A fast method for finding the GCD: repeatedly replace the pair (a, b) with (b, a mod b) until the remainder is zero. The last nonzero value is the GCD.

Prime factorization

Writing a number as a product of primes, such as 12 = 2 x 2 x 3. Every whole number above 1 has exactly one prime factorization, which is why the method always works.

Coprime

Two numbers are coprime, or relatively prime, when their only common factor is 1. Their GCF is 1 and their LCM is their product.

Ladder method

Also called the cake or box method. Divide a row of numbers by a common prime and write the quotients below, repeating until nothing is shared. The left column multiplies to the GCF; the left column times the bottom row gives the LCM.

Modulo (mod)

The remainder after division. 18 mod 12 = 6, because 18 divided by 12 leaves 6. The Euclidean algorithm is built entirely on this operation.

Frequently asked questions