#elementary-number-theory

Euler's totient $\phi (n)$ counts the integers in $1,\dots ,n$ that are coprime to $n$. When $n$ is prime, $\phi (n)=n-1$, which certainly divides $n-1$. Is there a composite number $n$ for which $\phi (n)$ divides $n-1$?