If , then the number of divisors is .
For , the divisor count is . Each divisor is formed by choosing a power of 2 (0 to 3) and a power of 3 (0 to 2). Product rule in action.
Using prime factorization
If , then the number of divisors is .
For , the divisor count is . Each divisor is formed by choosing a power of 2 (0 to 3) and a power of 3 (0 to 2). Product rule in action.