We prove that the set of positive integers having between $1$ and $n$ prime factors, counted with multiplicity, has degree of accessibility $2^n$. In particular, the case $n=1$ answers a question of Landman and Robertson asking whether the set of prime numbers is $2$-accessible.