Radix to Binary
---------------
Conversions from a power-of-2 radix into binary use a simple and fast
O(N) bitwise concatenation algorithm.
Conversions from other radices use repeated multiplications, first
accumulating as many digits as fit in a limb, then doing an Nx1
multi-precision multiplication. This is O(N^2) and is certainly
sub-optimal on sizes above the Karatsuba multiply threshold.