Divisor Count of 1260

Example of Use of Divisor Counting Function

 * $\map {\sigma_0} {1260} = 36$

where $\sigma_0$ denotes the divisor counting function.

Proof
From Divisor Counting Function from Prime Decomposition:
 * $\ds \map {\sigma_0} n = \prod_{j \mathop = 1}^r \paren {k_j + 1}$

where:
 * $r$ denotes the number of distinct prime factors in the prime decomposition of $n$
 * $k_j$ denotes the multiplicity of the $j$th prime in the prime decomposition of $n$.

We have that:
 * $1260 = 2^2 \times 3^2 \times 5 \times 7$

Thus:

The divisors of $1260$ can be enumerated as:
 * $1, 2, 3, 4, 5, 6, 7, 9, 10, 12, 14, 15, 18, 20, 21, 28, 30, 35, 36, 42, 45, 60, 63, 70, 84, 90, 105, 126, 140, 180, 210, 252, 315, 420, 630, 1260$