Common divisors of several numbers
Type two or more whole numbers. We list all the divisors they share.
Result
1, 2, 3, 4, 6, 12Common divisors
- GCD (the largest)
- 12
- How many common divisors
- 6
Inputs
- Your whole numbers
- 24; 36; 60
How it is calculated
The common divisors are exactly the divisors of the GCD.
Result
Common divisors
- GCD (the largest)
- 12
- How many common divisors
- 6
How it is calculated
- The common divisors are exactly the divisors of the GCD.
- The GCD comes from Euclid’s algorithm.
- Then the divisors of the GCD are listed from its prime factors.
Example
24, 36 and 60: GCD = 12, so the common divisors are 1, 2, 3, 4, 6, 12.
Good to know
- Minus signs are ignored. A 0 in the list changes nothing: every number divides 0.
- Whole numbers of at most 30 digits.
When to use it
- List the divisors shared by several whole numbers.
- Simplify fractions or check whether numbers are coprime.
Frequently asked questions
What is this tool used for?
Type two or more whole numbers. We list all the divisors they share.
How is the result calculated?
The common divisors are exactly the divisors of the GCD.
What should I check before using the result?
Minus signs are ignored. A 0 in the list changes nothing: every number divides 0.