There does not exist a "true" regular expression (i.e. a FSM) to check if a number is prime.

Proving this is a common assignment in automata theory classes.