From the prime factorization n = p^e × q^f …, finds the number of divisors as (e+1)(f+1)… and their sum as (1 + p + … + p^e)(1 + q + … + q^f)….