Sumivo · Mathematics
Divisors Calculator
Find a whole number's divisors and its divisor functions — the count d(n), the sum σ(n), the aliquot sum, and whether the number is perfect, abundant, or deficient.
01 / inputs
02 / result
CLASSIFICATION
Abundant
- Divisors d(n)
- 6
- Sum σ(n)
- 28
- Aliquot sum
- 16
- Divisors
- 1, 2, 3, 4, 6, 12
Calculation trace
- 66Number of divisors d(n)
- 1 + 2 + 3 + 4 + 6 + 12 = 2828Sum of divisors σ(n)
- 28 − 12 = 1616Aliquot sum (σ(n) − n)
Maintained by Jack Shi
How it works
A divisor of a whole number divides it exactly, leaving no remainder — for positive numbers the divisors are the same as the factors. The tool finds them all by trial up to the square root of n, then reports three number-theory quantities: d(n), the count of divisors; σ(n), the sum of all divisors; and the aliquot sum, σ(n) − n, which adds up only the proper divisors (everything except n itself). The aliquot sum decides the classification: a number is perfect when it equals its aliquot sum (6 = 1 + 2 + 3), abundant when the aliquot sum is larger (12, whose proper divisors sum to 16), and deficient when it is smaller (every prime is deficient, since its only proper divisor is 1).
Assumptions & limits
- Defined for whole numbers of 1 or greater; zero, negatives, and decimals are rejected.
- Counts positive divisors only; d(n) and σ(n) both include 1 and n.
- Inputs are capped at 1,000,000,000,000 so the search stays fast in the browser.
Verified runs
Synthetic examples executed at build revision be2e0e4 on . Cards round decimal results to 6 significant figures; matching uses full precision and the tolerance below. Matches cover the displayed fields, not every possible input or clinical or engineering validation.
Inputs: Integer: 12 integer
Result: Count: 6 count; Sum: 28 integer; Classification: abundant classification (expected Count: 6 count; Sum: 28 integer; Classification: abundant classification) ✓
Inputs: Integer: 1 integer
Result: Count: 1 count; Sum: 1 integer; Classification: deficient classification (expected Count: 1 count; Sum: 1 integer; Classification: deficient classification) ✓
Inputs: Integer: 28 integer
Result: Count: 6 count; Sum: 56 integer; Classification: perfect classification (expected Count: 6 count; Sum: 56 integer; Classification: perfect classification) ✓
How these runs were checked
Method: divisors@1.0.0. Expectations come from the listed test fixtures or hand arithmetic; they are not copied from these executions. Omitted optional inputs use the method defaults. Run dates record execution, not expert review or fresh measurements.
Download all verified runs (JSON) — full inputs, returned values, expectations, timestamps and buildRevision.
- normal: . Absolute tolerance: 1e-10. Text and booleans match exactly. Full-precision result: Count: 6 count; Sum: 28 integer; Classification: abundant classification. Expected: Count: 6 count; Sum: 28 integer; Classification: abundant classification. Expectation: packages/calculator-core/tests/divisors.test.ts
- boundary: . Absolute tolerance: 1e-10. Text and booleans match exactly. Full-precision result: Count: 1 count; Sum: 1 integer; Classification: deficient classification. Expected: Count: 1 count; Sum: 1 integer; Classification: deficient classification. Expectation: packages/calculator-core/tests/divisors.test.ts
- sensitivity: . Absolute tolerance: 1e-10. Text and booleans match exactly. Full-precision result: Count: 6 count; Sum: 56 integer; Classification: perfect classification. Expected: Count: 6 count; Sum: 56 integer; Classification: perfect classification. Expectation: packages/calculator-core/tests/divisors.test.ts
Reproduce from the source checkout with pnpm --filter @sumivo/web gen:verified-runs. A rebuild changes execution times; the revision identifies its Git starting point, including any uncommitted changes made for that build.
FAQ
- What does d(n) mean?
- d(n) is the number of positive divisors of n. For 12 the divisors are 1, 2, 3, 4, 6, 12, so d(12) = 6.
- What does σ(n) mean?
- σ(n) is the sum of all positive divisors of n, including n itself. For 12, σ(12) = 1 + 2 + 3 + 4 + 6 + 12 = 28.
- What is a perfect number?
- A number that equals the sum of its proper divisors (its aliquot sum). 6 = 1 + 2 + 3 and 28 = 1 + 2 + 4 + 7 + 14 are the first two perfect numbers.
- What is the difference between abundant and deficient numbers?
- A number is abundant when its proper divisors sum to more than the number (12 → 16) and deficient when they sum to less (10 → 8). Perfect numbers sit exactly on the boundary.
- How is this different from the factors calculator?
- The factors calculator focuses on listing every factor and its factor pairs. This one focuses on the divisor functions — how many divisors there are, their sum, and whether the number is perfect, abundant, or deficient.
Related calculators
SOURCES
- National Institute of Standards and Technology (NIST)NIST Digital Library of Mathematical Functions (DLMF) ↗
Divisor functions: number of divisors d(n), sum of divisors σ(n), and perfect numbers
Accessed 2026-08-20
- OpenStax, Rice UniversityPrealgebra 2e ↗
Divisors and divisibility of whole numbers
Accessed 2026-09-02