Union of two recursive languages is recursive

Regular languages are closed under infinite union.

The language $$\left\{ {{0^n}\,\left| {\,n} \right.} \right.$$ is prime$$\left. \, \right\}$$ is not regular