Unsigned: Integer -> Binary: 4 294 966 552 Convert the Positive Integer (Whole Number) From Base Ten (10) To Base Two (2), Conversion and Writing of Decimal System Number as Unsigned Binary Code
Unsigned (positive) integer number 4 294 966 552(10)
converted and written as an unsigned binary (base 2) = ?
1. Divide the number repeatedly by 2:
Keep track of each remainder.
We stop when we get a quotient that is equal to zero.
- division = quotient + remainder;
- 4 294 966 552 ÷ 2 = 2 147 483 276 + 0;
- 2 147 483 276 ÷ 2 = 1 073 741 638 + 0;
- 1 073 741 638 ÷ 2 = 536 870 819 + 0;
- 536 870 819 ÷ 2 = 268 435 409 + 1;
- 268 435 409 ÷ 2 = 134 217 704 + 1;
- 134 217 704 ÷ 2 = 67 108 852 + 0;
- 67 108 852 ÷ 2 = 33 554 426 + 0;
- 33 554 426 ÷ 2 = 16 777 213 + 0;
- 16 777 213 ÷ 2 = 8 388 606 + 1;
- 8 388 606 ÷ 2 = 4 194 303 + 0;
- 4 194 303 ÷ 2 = 2 097 151 + 1;
- 2 097 151 ÷ 2 = 1 048 575 + 1;
- 1 048 575 ÷ 2 = 524 287 + 1;
- 524 287 ÷ 2 = 262 143 + 1;
- 262 143 ÷ 2 = 131 071 + 1;
- 131 071 ÷ 2 = 65 535 + 1;
- 65 535 ÷ 2 = 32 767 + 1;
- 32 767 ÷ 2 = 16 383 + 1;
- 16 383 ÷ 2 = 8 191 + 1;
- 8 191 ÷ 2 = 4 095 + 1;
- 4 095 ÷ 2 = 2 047 + 1;
- 2 047 ÷ 2 = 1 023 + 1;
- 1 023 ÷ 2 = 511 + 1;
- 511 ÷ 2 = 255 + 1;
- 255 ÷ 2 = 127 + 1;
- 127 ÷ 2 = 63 + 1;
- 63 ÷ 2 = 31 + 1;
- 31 ÷ 2 = 15 + 1;
- 15 ÷ 2 = 7 + 1;
- 7 ÷ 2 = 3 + 1;
- 3 ÷ 2 = 1 + 1;
- 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.
Number 4 294 966 552(10), a positive integer number (with no sign),
converted from decimal system (from base 10)
and written as an unsigned binary (in base 2):
4 294 966 552(10) = 1111 1111 1111 1111 1111 1101 0001 1000(2)
Spaces were used to group digits: for binary, by 4, for decimal, by 3.
Convert positive integer numbers (unsigned) from decimal system (base ten) to binary (base two)
How to convert a base 10 positive integer number to base 2:
1) Divide the number repeatedly by 2, keeping track of each remainder, until getting a quotient that is 0;
2) Construct the base 2 representation by taking all the previously calculated remainders starting from the last remainder up to the first one, in that order.