GCD Calculator
Find the greatest common divisor of two integers.
Results are provided for general informational use. Verify important financial, health or legal figures before relying on them.
About this GCD Calculator
The GCD Calculator finds the largest positive integer that divides two integers without leaving a remainder. The same value is also called the greatest common factor or highest common factor in many textbooks.
For related tasks, try LCM Calculator, Prime Number Checker or Fraction Calculator.
How the calculation works
The tool uses the Euclidean algorithm, repeatedly replacing the larger relationship with a remainder until the remainder reaches zero. The last non-zero divisor is the GCD.
How to use it
- Enter the first integer.
- Enter the second integer.
- Calculate to find their greatest common divisor.
Practical example
The GCD of 48 and 18 is 6 because 6 is the largest integer that divides both values exactly.
Frequently asked questions
Is GCD the same as HCF?
Yes. GCD, GCF and HCF are commonly used for the same concept.
Can I use negative integers?
Yes. The absolute values are used for the divisor calculation.
What if one value is zero?
The GCD is the absolute value of the non-zero integer.
Keep exploring
View category →More Calculators
LCM CalculatorFind the least common multiple of two integers.Prime Number CheckerCheck whether a number is prime and see its smallest factor.Fraction CalculatorAdd, subtract, multiply or divide two fractions and simplify the result.Modulo CalculatorFind the remainder after dividing one number by another.Age CalculatorCalculate exact age in years, months and days between two dates.Percentage CalculatorFind a percentage of any number instantly.