Divisor Count of 1430

Example of Use of Divisor Counting Function

 * $\map \tau {1430} = 16$

where $\tau$ denotes the divisor counting (tau) function.

Proof
From Divisor Counting Function from Prime Decomposition:
 * $\ds \map \tau 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:
 * $1430 = 2 \times 5 \times 11 \times 13$

Thus:

The divisors of $1430$ can be enumerated as:
 * $1, 2, 5, 10, 11, 13, 22, 26, 55, 65, 110, 130, 143, 286, 715, 1430$