How to convert the base ten signed integer number 10 011 100 036 to base two:
- A signed integer, written in base ten, or a decimal system number, is a number written using the digits 0 through 9 and the sign, which can be positive (+) or negative (-). If positive, the sign is usually not written. A number written in base two, or binary, is a number written using only the digits 0 and 1.
To convert a base ten signed number (written as an integer in decimal system) to base two, written as a signed binary, follow the steps below.
- Divide the number repeatedly by 2: keep track of each remainder.
- Stop when you get a quotient that is equal to zero.
- Construct the base 2 representation of the positive number: take all the remainders starting from the bottom of the list constructed above.
- Determine the signed binary number bit length.
- Get the binary computer representation: if needed, add extra 0s in front (to the left) of the base 2 number, up to the required length and change the first bit (the leftmost), from 0 to 1, if the number is negative.
- Below you can see the conversion process to a signed binary and the related calculations.
1. Divide the number repeatedly by 2:
Keep track of each remainder.
Stop when you get a quotient that is equal to zero.
- division = quotient + remainder;
- 10 011 100 036 ÷ 2 = 5 005 550 018 + 0;
- 5 005 550 018 ÷ 2 = 2 502 775 009 + 0;
- 2 502 775 009 ÷ 2 = 1 251 387 504 + 1;
- 1 251 387 504 ÷ 2 = 625 693 752 + 0;
- 625 693 752 ÷ 2 = 312 846 876 + 0;
- 312 846 876 ÷ 2 = 156 423 438 + 0;
- 156 423 438 ÷ 2 = 78 211 719 + 0;
- 78 211 719 ÷ 2 = 39 105 859 + 1;
- 39 105 859 ÷ 2 = 19 552 929 + 1;
- 19 552 929 ÷ 2 = 9 776 464 + 1;
- 9 776 464 ÷ 2 = 4 888 232 + 0;
- 4 888 232 ÷ 2 = 2 444 116 + 0;
- 2 444 116 ÷ 2 = 1 222 058 + 0;
- 1 222 058 ÷ 2 = 611 029 + 0;
- 611 029 ÷ 2 = 305 514 + 1;
- 305 514 ÷ 2 = 152 757 + 0;
- 152 757 ÷ 2 = 76 378 + 1;
- 76 378 ÷ 2 = 38 189 + 0;
- 38 189 ÷ 2 = 19 094 + 1;
- 19 094 ÷ 2 = 9 547 + 0;
- 9 547 ÷ 2 = 4 773 + 1;
- 4 773 ÷ 2 = 2 386 + 1;
- 2 386 ÷ 2 = 1 193 + 0;
- 1 193 ÷ 2 = 596 + 1;
- 596 ÷ 2 = 298 + 0;
- 298 ÷ 2 = 149 + 0;
- 149 ÷ 2 = 74 + 1;
- 74 ÷ 2 = 37 + 0;
- 37 ÷ 2 = 18 + 1;
- 18 ÷ 2 = 9 + 0;
- 9 ÷ 2 = 4 + 1;
- 4 ÷ 2 = 2 + 0;
- 2 ÷ 2 = 1 + 0;
- 1 ÷ 2 = 0 + 1;
2. Construct the base 2 representation of the positive number:
Take all the remainders starting from the bottom of the list constructed above.
10 011 100 036(10) = 10 0101 0100 1011 0101 0100 0011 1000 0100(2)
3. Determine the signed binary number bit length:
The base 2 number's actual length, in bits: 34.
- A signed binary's bit length must be equal to a power of 2, as of:
- 21 = 2; 22 = 4; 23 = 8; 24 = 16; 25 = 32; 26 = 64; ...
- The first bit (the leftmost) is reserved for the sign:
- 0 = positive integer number, 1 = negative integer number
The least number that is:
1) a power of 2
2) and is larger than the actual length, 34,
3) so that the first bit (leftmost) could be zero
(we deal with a positive number at this moment)
=== is: 64.
4. Get the positive binary computer representation on 64 bits (8 Bytes):
If needed, add extra 0s in front (to the left) of the base 2 number, up to the required length, 64:
Number 10 011 100 036(10), a signed integer number (with sign),
converted from decimal system (from base 10)
and written as a signed binary (in base 2):
10 011 100 036(10) = 0000 0000 0000 0000 0000 0000 0000 0010 0101 0100 1011 0101 0100 0011 1000 0100
Spaces were used to group digits: for binary, by 4, for decimal, by 3.