$\phi(p) = p$ for prime $p$

$\phi(mn) = \phi(m)\phi(n)$ if $\gcd(m, n) > 1$

$\phi(p^k) = p^k - p^{k-1}$

$\phi(n)$ is always odd for $n > 2$