TR-MO 2001 Problem 3

One wants to distribute $n$ same sized cakes between $k$ people equally by cutting every cake at most once. If the number of positive divisors of $n$ is denoted as $d(n)$ , show that the number of different values of $k$ which makes such distribution possible is $n+d(n)$