Calculate the greatest (highest) common factor (divisor), gcf (hcf, gcd), by two methods: either the prime factorization, the numbers' divisibility, or the Euclidean Algorithm. Online calculator

Calculator of the greatest (highest) common factor (divisor), gcf, hcf, gcd

Calculate the greatest (highest) common factor (divisor) of numbers, gcd, hcf, gcd:

Method 1: Run the prime factorization of the numbers - then multiply all the common prime factors, taken by their smallest exponents. If there are no common prime factors, then gcf equals 1.

Method 2: The Euclidean Algorithm.

Method 3: The divisibility of the numbers.

The greatest (highest) common factor (divisor), gcf (hcf, gcd): the latest 13 calculated values

The gcf, hcf, gcd (7,661 and 1,980) = ? Sep 29 08:33 UTC (GMT)
The gcf, hcf, gcd (3,284 and 448) = ? Sep 29 08:33 UTC (GMT)
The gcf, hcf, gcd (4,863 and 1,133) = ? Sep 29 08:33 UTC (GMT)
The gcf, hcf, gcd (5,273 and 9,609) = ? Sep 29 08:33 UTC (GMT)
The gcf, hcf, gcd (1,680 and 8,586) = ? Sep 29 08:33 UTC (GMT)
The gcf, hcf, gcd (360 and 50) = ? Sep 29 08:33 UTC (GMT)
The gcf, hcf, gcd (134 and 3,337) = ? Sep 29 08:33 UTC (GMT)
The gcf, hcf, gcd (9,853 and 8,083) = ? Sep 29 08:33 UTC (GMT)
The gcf, hcf, gcd (575 and 990) = ? Sep 29 08:33 UTC (GMT)
The gcf, hcf, gcd (651 and 2,472) = ? Sep 29 08:33 UTC (GMT)
The gcf, hcf, gcd (171 and 5,478) = ? Sep 29 08:33 UTC (GMT)
The gcf, hcf, gcd (1,593 and 1,070) = ? Sep 29 08:33 UTC (GMT)
The gcf, hcf, gcd (6,462 and 77,514) = ? Sep 29 08:33 UTC (GMT)
The greatest (highest) common factor (divisor), gcf (hcf, gcd): the list of all the calculations

The greatest (highest) common factor (divisor), gcf, hcf, gcd. What it is and how to calculate it.


What is a prime number? Definition, examples

What is a composite number? Definition, examples

The prime numbers up to 1,000

The prime numbers up to 10,000

The Sieve of Eratosthenes

The Euclidean Algorithm

Completely reduce (simplify) fractions to the lowest terms: Steps and Examples