What are the required steps to convert base 10 decimal system
number 101 011 001 010 110 339 to base 2 unsigned binary equivalent?
- A number written in base ten, or a decimal system number, is a number written using the digits 0 through 9. A number written in base two, or a binary system number, is a number written using only the digits 0 and 1.
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;
- 101 011 001 010 110 339 ÷ 2 = 50 505 500 505 055 169 + 1;
- 50 505 500 505 055 169 ÷ 2 = 25 252 750 252 527 584 + 1;
- 25 252 750 252 527 584 ÷ 2 = 12 626 375 126 263 792 + 0;
- 12 626 375 126 263 792 ÷ 2 = 6 313 187 563 131 896 + 0;
- 6 313 187 563 131 896 ÷ 2 = 3 156 593 781 565 948 + 0;
- 3 156 593 781 565 948 ÷ 2 = 1 578 296 890 782 974 + 0;
- 1 578 296 890 782 974 ÷ 2 = 789 148 445 391 487 + 0;
- 789 148 445 391 487 ÷ 2 = 394 574 222 695 743 + 1;
- 394 574 222 695 743 ÷ 2 = 197 287 111 347 871 + 1;
- 197 287 111 347 871 ÷ 2 = 98 643 555 673 935 + 1;
- 98 643 555 673 935 ÷ 2 = 49 321 777 836 967 + 1;
- 49 321 777 836 967 ÷ 2 = 24 660 888 918 483 + 1;
- 24 660 888 918 483 ÷ 2 = 12 330 444 459 241 + 1;
- 12 330 444 459 241 ÷ 2 = 6 165 222 229 620 + 1;
- 6 165 222 229 620 ÷ 2 = 3 082 611 114 810 + 0;
- 3 082 611 114 810 ÷ 2 = 1 541 305 557 405 + 0;
- 1 541 305 557 405 ÷ 2 = 770 652 778 702 + 1;
- 770 652 778 702 ÷ 2 = 385 326 389 351 + 0;
- 385 326 389 351 ÷ 2 = 192 663 194 675 + 1;
- 192 663 194 675 ÷ 2 = 96 331 597 337 + 1;
- 96 331 597 337 ÷ 2 = 48 165 798 668 + 1;
- 48 165 798 668 ÷ 2 = 24 082 899 334 + 0;
- 24 082 899 334 ÷ 2 = 12 041 449 667 + 0;
- 12 041 449 667 ÷ 2 = 6 020 724 833 + 1;
- 6 020 724 833 ÷ 2 = 3 010 362 416 + 1;
- 3 010 362 416 ÷ 2 = 1 505 181 208 + 0;
- 1 505 181 208 ÷ 2 = 752 590 604 + 0;
- 752 590 604 ÷ 2 = 376 295 302 + 0;
- 376 295 302 ÷ 2 = 188 147 651 + 0;
- 188 147 651 ÷ 2 = 94 073 825 + 1;
- 94 073 825 ÷ 2 = 47 036 912 + 1;
- 47 036 912 ÷ 2 = 23 518 456 + 0;
- 23 518 456 ÷ 2 = 11 759 228 + 0;
- 11 759 228 ÷ 2 = 5 879 614 + 0;
- 5 879 614 ÷ 2 = 2 939 807 + 0;
- 2 939 807 ÷ 2 = 1 469 903 + 1;
- 1 469 903 ÷ 2 = 734 951 + 1;
- 734 951 ÷ 2 = 367 475 + 1;
- 367 475 ÷ 2 = 183 737 + 1;
- 183 737 ÷ 2 = 91 868 + 1;
- 91 868 ÷ 2 = 45 934 + 0;
- 45 934 ÷ 2 = 22 967 + 0;
- 22 967 ÷ 2 = 11 483 + 1;
- 11 483 ÷ 2 = 5 741 + 1;
- 5 741 ÷ 2 = 2 870 + 1;
- 2 870 ÷ 2 = 1 435 + 0;
- 1 435 ÷ 2 = 717 + 1;
- 717 ÷ 2 = 358 + 1;
- 358 ÷ 2 = 179 + 0;
- 179 ÷ 2 = 89 + 1;
- 89 ÷ 2 = 44 + 1;
- 44 ÷ 2 = 22 + 0;
- 22 ÷ 2 = 11 + 0;
- 11 ÷ 2 = 5 + 1;
- 5 ÷ 2 = 2 + 1;
- 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.
101 011 001 010 110 339(10) Base 10 decimal system number converted and written as a base 2 unsigned binary equivalent:
101 011 001 010 110 339 (base 10) = 1 0110 0110 1101 1100 1111 1000 0110 0001 1001 1101 0011 1111 1000 0011 (base 2)
Spaces were used to group digits: for binary, by 4, for decimal, by 3.