Greater Common Divisor (GCD) calculator
Greatest Common Divisor (GCD) calculator - solves GCD for given numbers, but also displays prime dividers (in a school-like way). So, you know how the solution is found. It can find the GCD for 3 numbers too !

Enter numbers

If you need only 2 numbers - just leave 3rd field empty!
Enter number #1Enter number #2Enter number #3
 3618931 2233
 31752158767938396913234411474971 222333377

Results

 Greatest Common Divisor (GCD) 36 GCD prime factors 22 × 32 Least common multiple (LCM) 31752 LCM prime factors 23 × 34 × 72 Processing time (performance) 1ms

Some facts

• Greatest Common Divisor is the largest positive integer that divides two or more numbers without remainder
• Greatest Common Divisor (GCD) is also known as Greatest Common Factor (GCF) and Highest Common Factor (HCF)
• GCD is mainly useful for reducing fractions to be in lowest terms possible.

For example, let's take a fraction of 4/6 (four sixth). The counter is 4, and the denominator is 6. GCD of the numbers 4 and 6 is 2, so divide the numerator and the fraction by 2 - we get 2/3 (two thirds), which is the simplest form of this fraction.

How to use this tool

To search for greatest common divisor or least common multiplier enter your numbers into fields below.
You can enter 2 or 3 integer numbers. If you need only 2 of them - just leave 3rd field empty!
All numbers should be non-zero integer (so you can use negative numbers).

Tags and links to this website

Tags:
Tags to Polish version:

What tags this calculator has

This is permalink. Permalink is the link containing your input data. Just copy it and share your work with friends:

Ancient version of this site - links

In December 2016 the Calculla website has been republished using new technologies and all calculators have been rewritten. Old version of the Calculla is still available through this link: v1.calculla.com. We left the version 1 of Calculla untouched for archival purposes.
Direct link to the old version:
"Calculla v1" version of this calculator
JavaScript failed !
So this is static version of this website.
This website works a lot better in JavaScript enabled browser.