Prove that the language is not regular

Prove that the next language $ Σ = {1 } $ is not regular.
$ L $ = $ {w | | w | = k $, or k $ is a prime number}.

How should one go about proving that? Should I use the pumping lemma for this?