What are the required steps to convert base 10 decimal system
number 11 001 100 011 111 101 411 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;
- 11 001 100 011 111 101 411 ÷ 2 = 5 500 550 005 555 550 705 + 1;
- 5 500 550 005 555 550 705 ÷ 2 = 2 750 275 002 777 775 352 + 1;
- 2 750 275 002 777 775 352 ÷ 2 = 1 375 137 501 388 887 676 + 0;
- 1 375 137 501 388 887 676 ÷ 2 = 687 568 750 694 443 838 + 0;
- 687 568 750 694 443 838 ÷ 2 = 343 784 375 347 221 919 + 0;
- 343 784 375 347 221 919 ÷ 2 = 171 892 187 673 610 959 + 1;
- 171 892 187 673 610 959 ÷ 2 = 85 946 093 836 805 479 + 1;
- 85 946 093 836 805 479 ÷ 2 = 42 973 046 918 402 739 + 1;
- 42 973 046 918 402 739 ÷ 2 = 21 486 523 459 201 369 + 1;
- 21 486 523 459 201 369 ÷ 2 = 10 743 261 729 600 684 + 1;
- 10 743 261 729 600 684 ÷ 2 = 5 371 630 864 800 342 + 0;
- 5 371 630 864 800 342 ÷ 2 = 2 685 815 432 400 171 + 0;
- 2 685 815 432 400 171 ÷ 2 = 1 342 907 716 200 085 + 1;
- 1 342 907 716 200 085 ÷ 2 = 671 453 858 100 042 + 1;
- 671 453 858 100 042 ÷ 2 = 335 726 929 050 021 + 0;
- 335 726 929 050 021 ÷ 2 = 167 863 464 525 010 + 1;
- 167 863 464 525 010 ÷ 2 = 83 931 732 262 505 + 0;
- 83 931 732 262 505 ÷ 2 = 41 965 866 131 252 + 1;
- 41 965 866 131 252 ÷ 2 = 20 982 933 065 626 + 0;
- 20 982 933 065 626 ÷ 2 = 10 491 466 532 813 + 0;
- 10 491 466 532 813 ÷ 2 = 5 245 733 266 406 + 1;
- 5 245 733 266 406 ÷ 2 = 2 622 866 633 203 + 0;
- 2 622 866 633 203 ÷ 2 = 1 311 433 316 601 + 1;
- 1 311 433 316 601 ÷ 2 = 655 716 658 300 + 1;
- 655 716 658 300 ÷ 2 = 327 858 329 150 + 0;
- 327 858 329 150 ÷ 2 = 163 929 164 575 + 0;
- 163 929 164 575 ÷ 2 = 81 964 582 287 + 1;
- 81 964 582 287 ÷ 2 = 40 982 291 143 + 1;
- 40 982 291 143 ÷ 2 = 20 491 145 571 + 1;
- 20 491 145 571 ÷ 2 = 10 245 572 785 + 1;
- 10 245 572 785 ÷ 2 = 5 122 786 392 + 1;
- 5 122 786 392 ÷ 2 = 2 561 393 196 + 0;
- 2 561 393 196 ÷ 2 = 1 280 696 598 + 0;
- 1 280 696 598 ÷ 2 = 640 348 299 + 0;
- 640 348 299 ÷ 2 = 320 174 149 + 1;
- 320 174 149 ÷ 2 = 160 087 074 + 1;
- 160 087 074 ÷ 2 = 80 043 537 + 0;
- 80 043 537 ÷ 2 = 40 021 768 + 1;
- 40 021 768 ÷ 2 = 20 010 884 + 0;
- 20 010 884 ÷ 2 = 10 005 442 + 0;
- 10 005 442 ÷ 2 = 5 002 721 + 0;
- 5 002 721 ÷ 2 = 2 501 360 + 1;
- 2 501 360 ÷ 2 = 1 250 680 + 0;
- 1 250 680 ÷ 2 = 625 340 + 0;
- 625 340 ÷ 2 = 312 670 + 0;
- 312 670 ÷ 2 = 156 335 + 0;
- 156 335 ÷ 2 = 78 167 + 1;
- 78 167 ÷ 2 = 39 083 + 1;
- 39 083 ÷ 2 = 19 541 + 1;
- 19 541 ÷ 2 = 9 770 + 1;
- 9 770 ÷ 2 = 4 885 + 0;
- 4 885 ÷ 2 = 2 442 + 1;
- 2 442 ÷ 2 = 1 221 + 0;
- 1 221 ÷ 2 = 610 + 1;
- 610 ÷ 2 = 305 + 0;
- 305 ÷ 2 = 152 + 1;
- 152 ÷ 2 = 76 + 0;
- 76 ÷ 2 = 38 + 0;
- 38 ÷ 2 = 19 + 0;
- 19 ÷ 2 = 9 + 1;
- 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.
11 001 100 011 111 101 411(10) Base 10 decimal system number converted and written as a base 2 unsigned binary equivalent:
11 001 100 011 111 101 411 (base 10) = 1001 1000 1010 1011 1100 0010 0010 1100 0111 1100 1101 0010 1011 0011 1110 0011 (base 2)
Spaces were used to group digits: for binary, by 4, for decimal, by 3.