What are the required steps to convert base 10 decimal system
number 110 011 011 001 010 082 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;
- 110 011 011 001 010 082 ÷ 2 = 55 005 505 500 505 041 + 0;
- 55 005 505 500 505 041 ÷ 2 = 27 502 752 750 252 520 + 1;
- 27 502 752 750 252 520 ÷ 2 = 13 751 376 375 126 260 + 0;
- 13 751 376 375 126 260 ÷ 2 = 6 875 688 187 563 130 + 0;
- 6 875 688 187 563 130 ÷ 2 = 3 437 844 093 781 565 + 0;
- 3 437 844 093 781 565 ÷ 2 = 1 718 922 046 890 782 + 1;
- 1 718 922 046 890 782 ÷ 2 = 859 461 023 445 391 + 0;
- 859 461 023 445 391 ÷ 2 = 429 730 511 722 695 + 1;
- 429 730 511 722 695 ÷ 2 = 214 865 255 861 347 + 1;
- 214 865 255 861 347 ÷ 2 = 107 432 627 930 673 + 1;
- 107 432 627 930 673 ÷ 2 = 53 716 313 965 336 + 1;
- 53 716 313 965 336 ÷ 2 = 26 858 156 982 668 + 0;
- 26 858 156 982 668 ÷ 2 = 13 429 078 491 334 + 0;
- 13 429 078 491 334 ÷ 2 = 6 714 539 245 667 + 0;
- 6 714 539 245 667 ÷ 2 = 3 357 269 622 833 + 1;
- 3 357 269 622 833 ÷ 2 = 1 678 634 811 416 + 1;
- 1 678 634 811 416 ÷ 2 = 839 317 405 708 + 0;
- 839 317 405 708 ÷ 2 = 419 658 702 854 + 0;
- 419 658 702 854 ÷ 2 = 209 829 351 427 + 0;
- 209 829 351 427 ÷ 2 = 104 914 675 713 + 1;
- 104 914 675 713 ÷ 2 = 52 457 337 856 + 1;
- 52 457 337 856 ÷ 2 = 26 228 668 928 + 0;
- 26 228 668 928 ÷ 2 = 13 114 334 464 + 0;
- 13 114 334 464 ÷ 2 = 6 557 167 232 + 0;
- 6 557 167 232 ÷ 2 = 3 278 583 616 + 0;
- 3 278 583 616 ÷ 2 = 1 639 291 808 + 0;
- 1 639 291 808 ÷ 2 = 819 645 904 + 0;
- 819 645 904 ÷ 2 = 409 822 952 + 0;
- 409 822 952 ÷ 2 = 204 911 476 + 0;
- 204 911 476 ÷ 2 = 102 455 738 + 0;
- 102 455 738 ÷ 2 = 51 227 869 + 0;
- 51 227 869 ÷ 2 = 25 613 934 + 1;
- 25 613 934 ÷ 2 = 12 806 967 + 0;
- 12 806 967 ÷ 2 = 6 403 483 + 1;
- 6 403 483 ÷ 2 = 3 201 741 + 1;
- 3 201 741 ÷ 2 = 1 600 870 + 1;
- 1 600 870 ÷ 2 = 800 435 + 0;
- 800 435 ÷ 2 = 400 217 + 1;
- 400 217 ÷ 2 = 200 108 + 1;
- 200 108 ÷ 2 = 100 054 + 0;
- 100 054 ÷ 2 = 50 027 + 0;
- 50 027 ÷ 2 = 25 013 + 1;
- 25 013 ÷ 2 = 12 506 + 1;
- 12 506 ÷ 2 = 6 253 + 0;
- 6 253 ÷ 2 = 3 126 + 1;
- 3 126 ÷ 2 = 1 563 + 0;
- 1 563 ÷ 2 = 781 + 1;
- 781 ÷ 2 = 390 + 1;
- 390 ÷ 2 = 195 + 0;
- 195 ÷ 2 = 97 + 1;
- 97 ÷ 2 = 48 + 1;
- 48 ÷ 2 = 24 + 0;
- 24 ÷ 2 = 12 + 0;
- 12 ÷ 2 = 6 + 0;
- 6 ÷ 2 = 3 + 0;
- 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.
110 011 011 001 010 082(10) Base 10 decimal system number converted and written as a base 2 unsigned binary equivalent:
110 011 011 001 010 082 (base 10) = 1 1000 0110 1101 0110 0110 1110 1000 0000 0001 1000 1100 0111 1010 0010 (base 2)
Spaces were used to group digits: for binary, by 4, for decimal, by 3.