A number theory problem by Dominick Hing

If No. = a^p × b^q × c^r × ... where a, b, c, ... are prime factors.

then total number of divisors = (p + 1)(q + 1)(r + 1) ...

2000 = 2^4 × 5^3 then total number of divisors = (4 + 1)(3 + 1) = 20

2000=2^4 5^3 here, a1=4, a2=3 total no. of divisors= (a1+1)(a2+1) =(4+1) (3+1)=20

2000= 2 ^ 4 * 5 ^3

number of divisors (factors) = (4+1) * (3+1) = 5 * 4

                                                  = 20