Enter your numbers
Type 2 to 6 whole numbers. You can also paste a list like
48, 180, 96 or 144 60. Negatives are allowed (we use absolute values).
Find the GCF (also called GCD) of 2–6 integers in seconds. Great for simplifying fractions, reducing ratios, and splitting things evenly — with step-by-step Euclidean Algorithm work.
Type 2 to 6 whole numbers. You can also paste a list like
48, 180, 96 or 144 60. Negatives are allowed (we use absolute values).
The Greatest Common Factor — also called the Greatest Common Divisor (GCD) — is the largest whole number that divides two or more integers without leaving a remainder. If you’ve ever simplified a fraction, reduced a ratio, split items evenly, or looked for the “biggest number that fits into all of them,” you’ve used the GCF.
This calculator finds the GCF for two up to six numbers instantly. It also shows the steps using the Euclidean Algorithm (the fastest classic method), and (optionally) explains how prime factorization connects to the same answer. Because it’s built for real life, you can paste values separated by commas or spaces, mix positives and negatives, and get a clean result.
84/126 by dividing top and bottom by the GCF.18:24 into 3:4.There isn’t a single “plug-and-chug” formula for GCF the way there is for percentage or area. Instead, we use algorithms — a repeatable process that always ends with the correct answer. The most famous is the Euclidean Algorithm:
Here a mod b means “the remainder when a is divided by b.”
This method is fast even for large numbers, and it’s what many programming languages use under the hood.
Let’s find the GCF of 252 and 105.
252 = 105×2 + 42105 = 42×2 + 2142 = 21×2 + 0The remainder hit 0, so the last non-zero divisor is 21. That means: GCF(252, 105) = 21.
For three or more numbers, we apply the GCF repeatedly:
So if you enter 48, 180, 96, the tool computes GCF(48,180) first, then takes the result with 96.
This is efficient and guarantees correctness.
Another way to think about GCF is through prime factors. If you break each number into primes, the GCF is the product of the primes they share, using the smallest exponent each prime appears with.
Example: Find the GCF of 72 and 90.
Common primes are 2 and 3. Take the smaller powers: 2¹ and 3². So GCF = 2¹ × 3² = 2 × 9 = 18.
Prime factorization is great for understanding, but for large numbers it can be slower than Euclid. That’s why this calculator uses Euclid for speed and shows steps in an easy-to-follow way.
12, 18, 30.If you want a quick shareable “math flex,” try these in the calculator:
People often confuse these because both involve “common.” Here’s the difference:
Fun fact: for two numbers a and b, GCF(a, b) × LCM(a, b) = |a × b|. That relationship can help you check your work.
Yes. Different textbooks use different terms: Greatest Common Factor (GCF) and Greatest Common Divisor (GCD) mean the same thing.
The GCF of (a, 0) is |a|. For multiple numbers, zeros don’t change the GCF unless all numbers are 0. If all inputs are 0, the GCF is undefined — the tool will tell you to enter at least one non‑zero number.
No. The GCF is always ≤ the smallest absolute value in your list, because it must divide every number.
Compute GCF(numerator, denominator) and divide both by that GCF. Example: 84/126 → GCF = 42 → (84÷42)/(126÷42) = 2/3.
Because any number that divides both a and b also divides (a − b×k). The remainder r = a mod b is exactly that kind of difference. So the set of common divisors stays the same as you replace (a, b) with (b, r), until r becomes 0.
Two numbers are coprime if their GCF is 1. Example: 35 and 64 are coprime (no shared prime factors).
No. All calculations run in your browser. If you click “Save Result,” it stores only the result locally on your device using localStorage.
Educational note: This GCF calculator is designed to be accurate and beginner-friendly. For formal math proofs or advanced number theory, consult a textbook or teacher. For everyday simplifying and checking, this tool is perfect.
While the calculator is fastest, it’s useful to know a few mental shortcuts — especially for quick checks:
Divisibility rules don’t replace Euclid, but they help you spot big common factors quickly:
In algebra, “factoring out the GCF” is one of the first techniques you learn because it simplifies expressions and reveals structure. If you have:
12x + 18
The GCF of 12 and 18 is 6, so you can factor:
12x + 18 = 6(2x + 3)
That’s useful for simplifying, solving equations, and working with polynomials. The same idea extends when variables are included — you take the greatest shared numerical factor and the smallest powers of shared variables.
Example 1: GCF of 144 and 60
Example 2: GCF of 81, 153, and 45
So the GCF of all three numbers is 9.
If you’re using this for school, a nice habit is to write your final result as a sentence: “The GCF of 48 and 180 is 12.” It makes your work clearer and easier to grade.
These are hand-picked from our Math & Conversion category to pair perfectly with GCF.
Accuracy note: This calculator uses the Euclidean Algorithm (standard in math and programming) and reports the GCF as a positive integer.