Code tool

Number of Divisors Calculator

Enter an integer from 1 through 1,000,000,000 to count its positive divisors.

In-browser processingNo account requiredPrivacy details ↗

Enter an integer from 1 to 1,000,000,000.

A QUICK WALKTHROUGH

How to use this tool

  1. Enter a positive integer from 1 to 1,000,000,000.
  2. Calculate the exact divisor count.
  3. Read how many positive divisors the integer has.

Divisor-count formula

If n has prime factorization p₁ᵃ¹ × … × pₖᵃᵏ, its positive-divisor count is (a₁ + 1) × … × (aₖ + 1). The calculation factors the entered number and multiplies one more than each exponent.

Input range and exact result

The accepted range is 1 through 1,000,000,000. The tool counts positive divisors only; negative divisors are excluded.

Local calculation

The number is processed in your browser. It is not uploaded.

GOOD TO KNOW

Common questions

Does this count negative divisors?

No. It counts positive divisors only.

What is the largest accepted integer?

1,000,000,000. Values below 1 or above the limit are rejected.

Is the result approximate?

No. For an accepted integer, the divisor count is calculated exactly.