Let $n \in \mathbf N^+$ and $a \in \mathbf N_{\ge 2}$. Every prime $\le 2n+1$ that doesn't divide $a$, is a divisor of $a^{(2n)!} - 1$ (by Fermat's little theorem). So we have $$\frac{\varphi(a^{(2n)!} - 1)}{a^{(2n)!} - 1} = \prod_{p \,\mid\, a^{(2n)!} - 1} \left(1 - \frac{1}{p}\right) \le \prod_{a < p \le 2n+1} \left(1 - \frac{1}{p}\right)\! \stackrel{n \to \infty}{\longrightarrow} 0,$$
where $p$ is always a prime and for the first equality we have used [Euler's product formula][1]. In particular, this shows that the limit inferior in the OP is $0$.


  [1]: https://en.wikipedia.org/wiki/Euler%27s_totient_function#Euler.27s_product_formula