GCF Calculator

Find the greatest common factor (GCF, also called the greatest common divisor or GCD) of two or more whole numbers. Enter your numbers separated by commas or spaces to see the largest number that divides all of them evenly.

Greatest common factor

12

Who should use it: Students simplifying fractions and anyone working with common divisors.

How to use this calculator

  1. 1Enter two or more whole numbers, separated by commas or spaces.
  2. 2Review the greatest common factor.

Understanding the inputs

NumbersTwo or more whole numbers, separated by commas or spaces. Decimal values are rounded to the nearest whole number before computing.

How the calculation works

The greatest common factor is the largest whole number that divides every value in your list without a remainder. The calculator uses the Euclidean algorithm, which repeatedly replaces the larger number by the remainder when divided by the smaller one until the remainder is zero; the last non-zero remainder is the GCF. It then combines the results across all the numbers in your list.

GCF(a, b) = last non-zero remainder from the Euclidean algorithm; GCF(list) = reduce pairwise

Worked example

Scenario: Numbers 24, 36, 60.

Result: GCF = 12, the largest number that divides 24, 36, and 60 evenly.

How to interpret your result

The result is the largest whole number that divides every value you entered without leaving a remainder. It is useful for simplifying fractions (divide the top and bottom by the GCF) and for grouping items into equal-sized sets. The GCF is also called the greatest common divisor (GCD).

Factors that can affect the result

  • Number of values: the calculator reduces all values pairwise, so adding more numbers can only lower or keep the same GCF.
  • Shared factors: the GCF is the product of the prime factors common to every value in the list.
  • Rounding: decimal inputs are rounded to the nearest whole number before the GCF is computed.

Limitations and assumptions

  • Works with whole numbers; decimal inputs are rounded before computing.
  • If every value is zero the GCF is reported as 0, since every number divides zero.
  • Reports a single GCF for the whole list; it does not show the step-by-step Euclidean algorithm.

Frequently asked questions

Related calculators

Methodology

The calculator computes the GCF of two numbers with the Euclidean algorithm and reduces the result across every value in the list. Decimal inputs are rounded to whole numbers first.

Sources and references

  • Mathematical basis — the Euclidean algorithm for the greatest common divisor is a standard result of number theory; no external source is required
Last reviewed: August 2026. Read our editorial policy.

Disclaimer: Results are provided for informational purposes and may vary depending on the values entered, the assumptions described above, and rounding. They are not a substitute for professional advice specific to your situation. Read the full disclaimer.