Divisor Count of 1330

Example of Use of Divisor Counting Function

 * $\map \tau {1330} = 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:
 * $1330 = 2 \times 5 \times 7 \times 19$

Thus:

The divisors of $1330$ can be enumerated as:
 * $1, 2, 5, 7, 10, 14, 19, 35, 38, 70, 95, 133, 190, 266, 665, 1330$