A unary language (a language over a unary alphabet) is context-free iff it is regular. Moreover, such a language is context-free (or regular) iff the set of lengths of words in the language is eventually periodic.
The set {$a^{n!}$ | $n\epsilon R$} is not eventually periodic: the gap between adjacent elements increases without bounds. So the language is neither regular nor context-free.
