HCF & GCD Calculator
Find the Highest Common Factor (HCF) or Greatest Common Divisor (GCD) of two or more numbers instantly.
HCF / GCD Calculator
Enter your numbers separated by commas or spaces.
Please provide at least 2 non-zero integers.
Highest Common Factor
6
HCF(12, 18, 24) = 6
Table of Contents
How to Calculate HCF / GCD
Understanding the Highest Common Factor.
The Highest Common Factor (HCF), also known as the Greatest Common Divisor (GCD), is the largest positive integer that divides two or more numbers evenly with no remainder.
Method 1: Prime Factorization
Find all the prime factors of each number. Multiply the common prime factors to get the HCF.
Example for 12 and 18:
- 12 = 2 × 2 × 3
- 18 = 2 × 3 × 3
Common factors: 2 × 3 = 6
Method 2: Euclidean Algorithm
Divide the larger number by the smaller number. If there is a remainder, divide the previous divisor by the remainder. Repeat this process until the remainder is 0. The final divisor is the HCF.
Common Examples
Click to load common combinations of numbers.
Frequently Asked Questions
Categories
Related Math Tools