Just as a counterpoint, there is a nice left-to-right method for reading binary numbers: start at the left, and then each time you move rightward, you double your previous total and add the current digit.
Example: $110010_2$:
$1$
$2\cdot 1+1=3$
$2\cdot 3+0=6$
$2\cdot 6+0=12$
$2\cdot 12+1=25$
$2\cdot 25+0=50$.
I have found (and my students too), that with practice, this method is quicker than the right-to-left method.
Edit based on a request for further explanation:
This method works in any base (and it is also the same idea as Horner's method for evaluating a polynomial). For example in base ten, if I started reading you digits of a number from left-to-right, say 3, 7, 9, 2, you could process this digit-by-digit with a provisional total at each step: 3, 37, 379, 3792; where at each step you multiply the previous result by ten (the base) and add the next digit.
In the example in my post (multiplying by two at each step), we get
$$((((1\cdot 2+1)\cdot 2+0)\cdot 2 + 0)\cdot 2+1)\cdot 2+0=1\cdot 2^5 + 1\cdot 2^4 + 0 \cdot 2^3 + 0\cdot 2^2 + 1\cdot 2+ 0$$
which is just the base-two expanded form of the numeral.