Let denote the divisor function; that is, is the number of natural numbers dividing . Prove .

I think there must be a trick that I'm missing. I've tried an inductive argument without success and know that where is the prime factorisation of , but I can't get anything to work. Thanks!