Euler's Totient Function

Let $\phi(n)$ denote the number of positive integers less than or equal to $n$ that are relatively prime to $n$, and let $d(n)$ denote the number of positive integer divisors of $n$. For example, $\phi(6) = 2$ and $d(6) = 4$. Find the sum of all odd integers $n \le 5000$ such that $n \mid \phi(n) d(n)$.

Source: 2012-2013 Winter Online Math Open