Binary number on individual bits in a single binary numeral provided as input. Sometimes, such operations may be used as arithmetic short-cuts, and may have other computational benefits as well. For example, an arithmetic shift left of a binary number is the equivalent of multiplication by a (positive, integral) power of 2. To convert from a base-10 integer to its base-2 (binary) equivalent, the number is divided by two. The remainder is the least-significant bit. The quotient is again divided by two; its remainder becomes the next least significant bit. This process repeats until a quotient of one is reached. The sequence
Skew binary number system with formula_8 1s is equal to the binary number formula_9 minus formula_8. Let formula_11 represents the digit formula_12 repeated formula_13 times. The skew binary number of the form formula_14 with formula_8 1s is equal to the binary number formula_16 minus formula_8. Similarly to the preceding section, the binary number formula_18 of the form formula_7 with formula_8 1s equals the skew binary number formula_21 plus formula_8. Note that since addition is not defined, adding formula_8 corresponds to incrementing the number formula_8 times. However, formula_8 is bounded by the logarithm of formula_18 and incrementation takes constant time. Hence transforming a binary number