1) If , then the number of different divisors of n is

2) If is a prime, then has different divisors, and the ones that are less than the number itself are .

Well, now just sum up the above divisors using the well known formula for the sum of geometric series and you'll get the original number again.

Tonio