“Random” is often used to describe prime numbers, whether in the literature or in articles intended for the general public. In this talk, we explore how (and in what sense) primes exhibit randomness, encountering many classical topics on the way, such as the fundamental theorem of arithmetic, Kronecker’s theorem on Diophantine approximation, Cramér’s conjecture on prime gaps, and even the Riemann hypothesis.