The following is a variant of Wilson's theorem:

Let $p$ be a positive integer and $1 \leq k \leq p-1$ . Then:
$p$ is prime if and only if $$(p-k)!(k-1)! \equiv (-1)^{k} \pmod{p}.$$

For particular $k = 1, 2, \ldots$ one gets nice results.