GCF Calculator

Find the Greatest Common Factor (GCF) of two or more numbers. Also known as Greatest Common Divisor (GCD) or Highest Common Factor (HCF).

What is the Greatest Common Factor?

The Greatest Common Factor (GCF) of two or more integers is the largest positive integer that divides each of the numbers without a remainder. It is also called the Greatest Common Divisor (GCD) or Highest Common Factor (HCF).

Methods to Find GCF

Method 1 — Prime Factorization

Break each number into its prime factors, then multiply the common ones.

GCF(48, 36):
48 = 2 × 2 × 2 × 2 × 3
36 = 2 × 2 × 3 × 3
Common factors: 2 × 2 × 3 = 12

Method 2 — Euclidean Algorithm

GCF(a, b) = GCF(b, a mod b) until remainder = 0
GCF(48, 36):
GCF(48, 36) → GCF(36, 12) → GCF(12, 0) = 12

GCF Reference Table

NumbersGCF
12, 186
24, 3612
15, 255
100, 7525
56, 9814
120, 18060

FAQ

What is GCF used for?

GCF is used to simplify fractions, factor polynomials, and solve problems involving groups or equal sharing.

What is the GCF of two prime numbers?

The GCF of any two distinct prime numbers is always 1, because primes have no common factors other than 1.

Last updated: 2026-08-08