At first glance, it seems like the pumping lemmas should somehow "easily" show that an infinite set of primes (say, written in binary) cannot be a regular language or context-free grammar. But I don't see how to prove it because the part of the binary expansion being pumped can be in the middle of the string. Is it known whether an infinite set of primes can be a regular language or CFG, and how to show it?