Fermat, Euler and Wilson · Challenge problem

Euler says $a^8 \equiv 1 \pmod{15}$ whenever $\gcd(a, 15) = 1$. What is the smallest positive $k$ with $a^k \equiv 1 \pmod{15}$ for every $a$ coprime to $15$?