Counting & Number Theory

Prime Factorization, Divisors & Totient Calculator

Factor a bounded positive integer and derive divisor count, divisor sum and Euler totient.

How the calculation works

Factor n = product of p^e. Divisor count = product of (e+1). Divisor sum = product of (1+p+…+p^e). Euler totient = n × product over distinct primes p of (1−1/p). Trial division stops once the candidate divisor exceeds the square root of the remaining cofactor.

Worked example

Example inputs — Positive integer, at most 10¹²: 360. Expected results — Prime factorization: 2^3 × 3^2 × 5; Number of positive divisors: 24 divisors; Sum of positive divisors: 1170; Euler totient: 96; Is the entered integer prime?: No.

Assumptions and limits

Exact integer arithmetic is used for counts and integer results. Computation limits keep this browser tool responsive. Specify whether objects/groups are distinguishable and whether order matters; different conventions count different outcomes. Trial division for 1 ≤ n ≤ 10¹²; not intended for cryptographic-size factorization. For n=1 the empty prime product is shown as 1, divisor count/sum are 1, totient is 1 and primality is No.

Reference and further reading

Read the underlying subject reference. Calculith is an independent implementation; the reference does not endorse or certify this tool.

Related calculators

Browse all 1000 calculators →

Example values are editable. Results are estimates where assumptions apply. Calculations run in your browser. Updated 2026-11-16.