TITLE: Interesting resolution to considering prime factorisations and finding the number of positive divisors of large numbers??
QUESTION [2 upvotes]: I was trying to figure out the number of positive divisors of large numbers and came across something interesting.
I'm not sure whether this is a theorem that already exists, it probably does and I've just never come across it. 
So if you consider the prime factor $1 000 000$,
That's $10^6= (5\times2)^6 = 5^6 \times 2^6$
Now this is as simplified product of prime factors you can get for $1 000 000$.
I manually calculated the number of positive divisors there are for $1 000 000$ and I figured out that there were $49$ of them. 
What I noticed however, was $49$ was the $(6+1) \times (6+1)$, 6 being the powers of the simplified product of prime factors. 
Now I let this be to coincidence but I tried it for another number.
The prime factors of $315 000$ 
$315 \times 10^3 = 63 \times 5 \times 5^3 \times 2^3$ = $9 \times 7 \times 5^4 \times 2^3$ 
When you manually calculate the number of prime divisors, you obtain $120$, which is also the product of $(3+1)(2+1)(4+1)(1+1) = 120, 3,2,4$ and  $1$ being the powers of the product of prime factors.
Now, does this apply to all prime factorisations and number of divisors or am I looking silly and just stating a well-known theorem or is this is just a massive coincidence?
This possibly involves a hint of combinatorics.
Any explanation is appreciated!

REPLY [4 votes]: In order to generate each factor of a number $n = \prod p_i^{k_i}$, you need to select a power from each dividing prime to multiply in to that factor. For each dividing prime $p_i$ with exponent $k_i$, you have $k_i+1$ choices. These are all independent choices so the total number of factors is as you have found, $\prod (k_i+1)$.
{"set_name": "stack_exchange", "score": 2, "question_id": 2081049}