Divisor Count of 368

Example of Use of Divisor Counting Function

 * $\map \tau {368} = 10$

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:
 * $368 = 2^4 \times 23$

Thus:

The divisors of $368$ can be enumerated as:
 * $1, 2, 4, 8, 16, 23, 46, 92, 184, 368$