Divisor Calculator

Divisor Calculator

Find every positive divisor of one integer, or compare two integers to identify the positive divisors they share.

Number #1: 36 Divisors: 9 Number #2: 48 Common: 6

Ready to export the current results.

Inputs

Required positive integer from 1 to 1,000,000,000,000. Comma grouping is accepted.

Optional. Add a second positive integer to calculate the divisors common to both numbers.

Live results

Positive divisors of Number #1

9 divisors

Prime factorization #1

2² × 3²

Positive divisors of Number #2

10

Prime factorization: 2⁴ × 3

Common positive divisors

6

Largest common divisor: 12

36 has 9 positive divisors; 36 and 48 share 6 positive divisors.

Divisor lists

Divisors of Number #1

Divisors of Number #2

Common divisors

Divisor details for Number #1

Divisor Quotient Also divides Number #2?

Each row verifies the identity Number #1 = divisor × quotient. The final column marks whether that divisor also divides Number #2.

How to use this divisor calculator

What this calculator does. The calculator finds the positive integer divisors, also called positive factors, of a required Number #1. A divisor is a whole number that multiplies by another whole number to reproduce the original integer. If you also provide Number #2, the calculator identifies the positive divisors shared by both numbers. This is an exact integer calculation within the supported input range; it is not a probability, estimate, or approximation. For the formal number-theory definition, the University of Southampton explains that an integer d divides an integer a when another integer b exists such that db = a in its introductory notes on divisors.

When to use it. Use the calculator when you need to list every exact factor of an integer, check factor pairs before simplifying a numerical expression, compare two integers for shared factors, or verify a divisibility exercise. It is also useful as a quick first step before studying prime factorization or greatest-common-divisor methods.

How to calculate. The calculator opens with the ready-to-use demonstration values 36 and 48, so the results and Excel workbook are immediately available. To work with your own numbers:

  1. Replace Number #1 with the positive integer whose divisors you want. Results update as soon as the entry is valid.
  2. Optionally replace or clear Number #2. When it is present, read the shared factors under Common divisors and use the detail table to see which divisors of Number #1 also divide Number #2.
  3. Review the divisor lists, prime factorizations, and exact divisor/quotient pairs. Choose Download Excel to export the current validated state. Reset clears both demonstration inputs and all computed results; after Reset, Excel export stays disabled until a valid Number #1 is entered again.

Input guide. Number #1 is required and must be a positive integer from 1 through 1,000,000,000,000. Plain digits such as 360 and standard three-digit comma grouping such as 1,000 are accepted. Decimals, signs, scientific notation, and ambiguous grouping are rejected. Increasing Number #1 does not necessarily increase the divisor count: divisor count depends on prime-exponent structure, not size alone. Number #2 follows the same format and range but is optional. Entering it adds the comparison; clearing it returns to a one-number calculation. A common mistake is to type a decimal or treat a multiple as a divisor. Divisors must divide the original integer with zero remainder.

Output guide. Positive divisors of Number #1 is the exact count of listed positive factors. Prime factorization #1 expresses Number #1 as a product of prime powers; for 1, the calculator reports “1 (unit)” because 1 is neither prime nor composite. The Number #2 card reports its divisor count and factorization when supplied. Common positive divisors is the exact number of shared positive factors; Largest common divisor is the greatest value in that shared list. The Divisor lists enumerate the actual positive factors in ascending order. In the detail table, Divisor is a factor of Number #1, Quotient is Number #1 divided by that factor, and Also divides Number #2? is a yes/no identity check when Number #2 exists. Zero does not appear because this calculator is defined for positive input integers and positive divisors.

Worked example. With the startup value Number #1 = 36, the prime factorization is 2² × 3². Any positive divisor can use exponent 0, 1, or 2 for the factor 2 and independently exponent 0, 1, or 2 for the factor 3, giving (2 + 1)(2 + 1) = 9 positive divisors: 1, 2, 3, 4, 6, 9, 12, 18, and 36. With Number #2 = 48, whose prime factorization is 2⁴ × 3, the shared divisors are 1, 2, 3, 4, 6, and 12. Therefore the first-open display correctly shows 9 divisors for 36 and 6 common divisors for 36 and 48. Wolfram MathWorld gives the same prime-exponent rule for the number of divisors of an integer.

How the divisor method works

For a positive integer, the calculator first finds its prime factorization. If n = p₁ᵃ¹ × p₂ᵃ² × ... × pᵣᵃʳ, every positive divisor is formed by choosing an exponent from 0 through aᵢ for each prime. That makes the divisor-count identity a product of choices:

divisor count = (a₁ + 1)(a₂ + 1)...(aᵣ + 1)

The generated divisor values are then sorted in ascending order and independently checked through integer multiplication when displayed as divisor/quotient pairs. When two numbers are supplied, the common-divisor list contains only values that divide both integers exactly. Khan Academy's factors and multiples unit provides additional practice with factor pairs, divisibility, and prime factorization.

Interpreting special cases

The number 1 has exactly one positive divisor: 1. A prime number greater than 1 has exactly two positive divisors, 1 and itself. Composite integers have more than two positive divisors. Perfect squares have an odd divisor count because the square-root divisor pairs with itself; non-squares have divisors in distinct pairs, so their divisor count is even. When Number #2 is omitted, the common-divisor comparison is intentionally hidden rather than inferred. If an input is invalid or incomplete, the calculator removes calculated results instead of displaying stale values, and the workbook export is blocked until the required Number #1 is valid again.