Skip to content
Embed

Paste this on your site. The attribution link is required and is what makes embedding free.

GCF Calculator — Free Online Greatest Common Factor Calculator

Find the greatest common factor of two or more numbers instantly with step-by-step Euclidean algorithm solutions and factor analysis.

Enter 2 or more positive integers

Parsed Numbers

48, 36, 60

Greatest Common Factor

12

Euclidean Algorithm Steps

GCF(48, 36) = 12

GCF(12, 60) = 12

GCF Details

GCF(48, 36, 60) = 12

Factors of GCF: 1, 2, 3, 4, 6, 12

GCF Reference Table

Number Pair GCF Method Coprime?
12, 18 6 18 = 1x12+6, 12 = 2x6+0 No
24, 36 12 36 = 1x24+12, 24 = 2x12+0 No
7, 13 1 Both prime, no common factors Yes
100, 75 25 100 = 1x75+25, 75 = 3x25+0 No
48, 36, 60 12 GCF(48,36)=12, GCF(12,60)=12 No
8, 15 1 15 = 1x8+7, 8 = 1x7+1, 7 = 7x1+0 Yes
270, 192 6 270=1x192+78, 192=2x78+36, 78=2x36+6, 36=6x6+0 No

Related Calculators

About this calculator

GCF Formula and the Euclidean Algorithm

Euclidean Algorithm

GCF(a, b) = GCF(b, a mod b), until b = 0

GCF-LCM Relationship

GCF(a, b) x LCM(a, b) = a x b

Prime Factorization Method

GCF = product of lowest powers of common prime factors

Variables Explained

  • a, b: The two positive integers whose GCF you want to find. When finding the GCF of more than two numbers, the algorithm is applied iteratively: first compute GCF(a, b), then compute GCF(result, c), and so on.
  • mod (modulo): The remainder operator. "a mod b" gives the remainder when a is divided by b. For example, 48 mod 18 = 12, because 48 = 2 x 18 + 12.
  • GCF result: The final non-zero value when the algorithm terminates. When the remainder reaches 0, the previous divisor is the GCF.

Step-by-Step Example

Find GCF(252, 198):

  1. 252 = 1 x 198 + 54 (remainder is 54)
  2. 198 = 3 x 54 + 36 (remainder is 36)
  3. 54 = 1 x 36 + 18 (remainder is 18)
  4. 36 = 2 x 18 + 0 (remainder is 0, so we stop)

The last non-zero remainder is 18, so GCF(252, 198) = 18. You can verify: 252 / 18 = 14 and 198 / 18 = 11, both whole numbers. The Euclidean algorithm is highly efficient, running in O(log(min(a, b))) time, making it practical even for very large numbers.

Sources

Disclaimer: This calculator is for informational and educational purposes only. Results are estimates and may not reflect exact values.

Last updated: November 3, 2026