Math

GCF Calculator

Find the greatest common factor (greatest common divisor) of two or more whole numbers.

Free online toolWorks in your browserNo sign-up required

GCF Calculator

Explore this topic

Fractions, Ratios & Proportions

Fraction arithmetic, decimal-to-fraction conversion, ratios and proportions.

Topic hub →

How to use this gcf calculator

Enter the values requested above and select Calculate. Change any input to compare another scenario. The calculation runs locally in your browser and does not require an account.

Formula and method

Repeatedly apply the Euclidean algorithm to find the largest integer that divides every value without a remainder.

Example

GCF(24, 36, 60) = 12.

What this calculator is useful for

Find the greatest common factor (greatest common divisor) of two or more whole numbers. The result is intended for quick estimates, checking arithmetic and comparing scenarios. When a result affects a contract, tax filing, medical decision, building-code requirement or other high-stakes situation, verify the result with the appropriate professional or authoritative source.

Find the largest divisor shared by several values

The numbers 24, 36, and 60 are all divisible by 12. Their greatest common factor is 12, so a ratio 24:36 can be reduced by dividing both values by 12.

GCF versus LCM: GCF finds the largest number that divides all entries, while LCM finds the smallest positive number divisible by all entries. Enter whole numbers rather than decimals.

Frequently asked questions

What does the GCF Calculator calculate?

Find the greatest common factor (greatest common divisor) of two or more whole numbers.

How does the GCF Calculator work?

Repeatedly apply the Euclidean algorithm to find the largest integer that divides every value without a remainder.

Is the GCF Calculator free to use?

Yes. ERICH Calculators is free to use and does not require an account.

Transparency

Method, assumptions & corrections

See how formulas, sources and limitations are handled across ERICH Calculators.