While I agree that the probability of selecting a single number is zero, I think it is possible to make sense of something like "the probability of a natural number to be odd" by using a limit, i.e. P({n in {0, 1, 2, ..} : n is odd}) = lim_{M to infinity} P({n in {0, 1, 2, .., M-1} : n is odd}). This is a well defined limit and its value is 1/2. But even if we use a definition like this one, the rest of the sentences in the problem still does not make any sense to me.
When I said the problem was equivalent to the one where we limit ourself to the first two bits I used the definition above. Indeed, if we take M = 2^m, we may represent the numbers from 0 to M-1 as strings of m bits. The set we are sampling from is then equal to {0, 1}^m and the set of odd numbers is {1} x {0, 1}^{m-1}. Since the remaining (m-1) bits can be chosen at random without limitations, this is equivalent to the choice of just the first bit value (the rest does not matter for the probability). For this reason, we have that
P({n in {0, 1, 2, ..} : n is odd}) = lim_{M to infinity} P({n in {0, 1, 2, .., M-1} : n is odd}) = lim_{m to infinity} P({n in {0,1, .. 2^(m-1)} : n is odd} = lim_{m to infinity} P({n in {0, 1} : n == 1}) = P({n in {0,1} : n == 1}).