Skip to content

Factor Calculator

Find all factors and factor pairs of a number with prime, composite, and perfect number detection.

Number details

Updates as you type
Mode
What do you want to find? ?
Number
Integer ?
11001k10k
Try an example
Display (optional)
Factor list separator
Factor pairs layout

All factors

Factor pairs

Step-by-step factorization

Trial division by ascending primes.

    Formula

    τ(n) = (a1+1) · (a2+1) · · (ak+1)
    n
    The integer being analyzed (n ≥ 1)
    piai
    Prime pi raised to its multiplicity ai in n's factorization
    τ(n)
    Number of positive divisors — product of (ai+1)
    σ(n)
    Sum of divisors — ∏ (piai+1−1) / (pi−1)
    s(n)
    Aliquot sum — σ(n) − n. Classifies n as deficient, perfect, or abundant.
    WORKED EXAMPLE — YOUR NUMBER
    1. Start with
    2. Factor into primes:
    3. Divisor count τ(n) =
    4. Divisor sum σ(n) =
    5. Aliquot sum s(n) =

    A positive integer n has exactly τ(n) factors, laid out as pairs (d, n/d) that meet at √n. When n is a perfect square, one pair collapses (√n × √n), giving an odd factor count — perfect squares are the only integers with an odd number of divisors.