Implementing sieve of eratosthenes in bitwise form

Question

I am trying to learn the concept behind using bitwise for the sieve of Eratosthenes. From what I read I understand that each element of the prime array stores the prime status (