Find a common factor for several integers
Paste two to 100 whole numbers in Integers, separated by commas, spaces or line breaks, and select Calculate. The result is the greatest common divisor, also called the highest common factor, of the entire list. It is computed exactly using repeated Euclidean greatest-common-divisor steps.
Example: 24, 36 and 60
Load the example to use 24, 36 and 60. The first two values have GCD 12, and combining that with 60 leaves 12. Each input can be divided by 12 without a remainder. The reported count is three, including any repeated values you enter; duplicate values do not change the GCD.
Negative values and zeros
The calculation uses magnitudes, so -24, 36 has the same GCD as 24, 36. A zero alongside a nonzero integer is allowed: gcd(0, 18) is 18. An all-zero list returns zero as an explicitly chosen computational convention. It should not be interpreted as a greatest positive divisor, because every positive integer divides zero.
The result helps simplify integer ratios or identify a common grouping size. It does not tell you which grouping is useful for a real-world task unless your quantities use compatible units and count the intended objects.
Input rules
Each integer can contain up to 12 digits and an optional leading plus or minus sign. The total input cannot exceed 1,500 characters. Decimal points, exponent notation and units are rejected. Do not use commas as thousands separators: 1,000 is parsed as two values, 1 and 000. Enter 1000 for one thousand.
Editing the list clears the old output. Results stay in the browser and can be copied as labeled text. Use Ratio Calculator for a two-part simplified ratio, or Least Common Multiple Calculator when you need a shared multiple instead of a common divisor.





