Comment by cocoto

You can use the number 0.{concatenation of all 1 bit strings ordered}{concatenation of all 2 bits strings ordered} = 0.0100011011…

Now an interesting problem would be to have the most “compact” number, where you can find all the strings of length n in a minimal number of digits of such number. It reminds me of the math problem solved by a 4chan user.