What are the required steps to convert base 10 decimal system
number 130 313 110 011 199 921 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;
- 130 313 110 011 199 921 ÷ 2 = 65 156 555 005 599 960 + 1;
- 65 156 555 005 599 960 ÷ 2 = 32 578 277 502 799 980 + 0;
- 32 578 277 502 799 980 ÷ 2 = 16 289 138 751 399 990 + 0;
- 16 289 138 751 399 990 ÷ 2 = 8 144 569 375 699 995 + 0;
- 8 144 569 375 699 995 ÷ 2 = 4 072 284 687 849 997 + 1;
- 4 072 284 687 849 997 ÷ 2 = 2 036 142 343 924 998 + 1;
- 2 036 142 343 924 998 ÷ 2 = 1 018 071 171 962 499 + 0;
- 1 018 071 171 962 499 ÷ 2 = 509 035 585 981 249 + 1;
- 509 035 585 981 249 ÷ 2 = 254 517 792 990 624 + 1;
- 254 517 792 990 624 ÷ 2 = 127 258 896 495 312 + 0;
- 127 258 896 495 312 ÷ 2 = 63 629 448 247 656 + 0;
- 63 629 448 247 656 ÷ 2 = 31 814 724 123 828 + 0;
- 31 814 724 123 828 ÷ 2 = 15 907 362 061 914 + 0;
- 15 907 362 061 914 ÷ 2 = 7 953 681 030 957 + 0;
- 7 953 681 030 957 ÷ 2 = 3 976 840 515 478 + 1;
- 3 976 840 515 478 ÷ 2 = 1 988 420 257 739 + 0;
- 1 988 420 257 739 ÷ 2 = 994 210 128 869 + 1;
- 994 210 128 869 ÷ 2 = 497 105 064 434 + 1;
- 497 105 064 434 ÷ 2 = 248 552 532 217 + 0;
- 248 552 532 217 ÷ 2 = 124 276 266 108 + 1;
- 124 276 266 108 ÷ 2 = 62 138 133 054 + 0;
- 62 138 133 054 ÷ 2 = 31 069 066 527 + 0;
- 31 069 066 527 ÷ 2 = 15 534 533 263 + 1;
- 15 534 533 263 ÷ 2 = 7 767 266 631 + 1;
- 7 767 266 631 ÷ 2 = 3 883 633 315 + 1;
- 3 883 633 315 ÷ 2 = 1 941 816 657 + 1;
- 1 941 816 657 ÷ 2 = 970 908 328 + 1;
- 970 908 328 ÷ 2 = 485 454 164 + 0;
- 485 454 164 ÷ 2 = 242 727 082 + 0;
- 242 727 082 ÷ 2 = 121 363 541 + 0;
- 121 363 541 ÷ 2 = 60 681 770 + 1;
- 60 681 770 ÷ 2 = 30 340 885 + 0;
- 30 340 885 ÷ 2 = 15 170 442 + 1;
- 15 170 442 ÷ 2 = 7 585 221 + 0;
- 7 585 221 ÷ 2 = 3 792 610 + 1;
- 3 792 610 ÷ 2 = 1 896 305 + 0;
- 1 896 305 ÷ 2 = 948 152 + 1;
- 948 152 ÷ 2 = 474 076 + 0;
- 474 076 ÷ 2 = 237 038 + 0;
- 237 038 ÷ 2 = 118 519 + 0;
- 118 519 ÷ 2 = 59 259 + 1;
- 59 259 ÷ 2 = 29 629 + 1;
- 29 629 ÷ 2 = 14 814 + 1;
- 14 814 ÷ 2 = 7 407 + 0;
- 7 407 ÷ 2 = 3 703 + 1;
- 3 703 ÷ 2 = 1 851 + 1;
- 1 851 ÷ 2 = 925 + 1;
- 925 ÷ 2 = 462 + 1;
- 462 ÷ 2 = 231 + 0;
- 231 ÷ 2 = 115 + 1;
- 115 ÷ 2 = 57 + 1;
- 57 ÷ 2 = 28 + 1;
- 28 ÷ 2 = 14 + 0;
- 14 ÷ 2 = 7 + 0;
- 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.
130 313 110 011 199 921(10) Base 10 decimal system number converted and written as a base 2 unsigned binary equivalent:
130 313 110 011 199 921 (base 10) = 1 1100 1110 1111 0111 0001 0101 0100 0111 1100 1011 0100 0001 1011 0001 (base 2)
Spaces were used to group digits: for binary, by 4, for decimal, by 3.