What are the required steps to convert base 10 decimal system
number 101 710 160 150 851 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 710 160 150 851 ÷ 2 = 50 855 080 075 425 + 1;
- 50 855 080 075 425 ÷ 2 = 25 427 540 037 712 + 1;
- 25 427 540 037 712 ÷ 2 = 12 713 770 018 856 + 0;
- 12 713 770 018 856 ÷ 2 = 6 356 885 009 428 + 0;
- 6 356 885 009 428 ÷ 2 = 3 178 442 504 714 + 0;
- 3 178 442 504 714 ÷ 2 = 1 589 221 252 357 + 0;
- 1 589 221 252 357 ÷ 2 = 794 610 626 178 + 1;
- 794 610 626 178 ÷ 2 = 397 305 313 089 + 0;
- 397 305 313 089 ÷ 2 = 198 652 656 544 + 1;
- 198 652 656 544 ÷ 2 = 99 326 328 272 + 0;
- 99 326 328 272 ÷ 2 = 49 663 164 136 + 0;
- 49 663 164 136 ÷ 2 = 24 831 582 068 + 0;
- 24 831 582 068 ÷ 2 = 12 415 791 034 + 0;
- 12 415 791 034 ÷ 2 = 6 207 895 517 + 0;
- 6 207 895 517 ÷ 2 = 3 103 947 758 + 1;
- 3 103 947 758 ÷ 2 = 1 551 973 879 + 0;
- 1 551 973 879 ÷ 2 = 775 986 939 + 1;
- 775 986 939 ÷ 2 = 387 993 469 + 1;
- 387 993 469 ÷ 2 = 193 996 734 + 1;
- 193 996 734 ÷ 2 = 96 998 367 + 0;
- 96 998 367 ÷ 2 = 48 499 183 + 1;
- 48 499 183 ÷ 2 = 24 249 591 + 1;
- 24 249 591 ÷ 2 = 12 124 795 + 1;
- 12 124 795 ÷ 2 = 6 062 397 + 1;
- 6 062 397 ÷ 2 = 3 031 198 + 1;
- 3 031 198 ÷ 2 = 1 515 599 + 0;
- 1 515 599 ÷ 2 = 757 799 + 1;
- 757 799 ÷ 2 = 378 899 + 1;
- 378 899 ÷ 2 = 189 449 + 1;
- 189 449 ÷ 2 = 94 724 + 1;
- 94 724 ÷ 2 = 47 362 + 0;
- 47 362 ÷ 2 = 23 681 + 0;
- 23 681 ÷ 2 = 11 840 + 1;
- 11 840 ÷ 2 = 5 920 + 0;
- 5 920 ÷ 2 = 2 960 + 0;
- 2 960 ÷ 2 = 1 480 + 0;
- 1 480 ÷ 2 = 740 + 0;
- 740 ÷ 2 = 370 + 0;
- 370 ÷ 2 = 185 + 0;
- 185 ÷ 2 = 92 + 1;
- 92 ÷ 2 = 46 + 0;
- 46 ÷ 2 = 23 + 0;
- 23 ÷ 2 = 11 + 1;
- 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 710 160 150 851(10) Base 10 decimal system number converted and written as a base 2 unsigned binary equivalent:
101 710 160 150 851 (base 10) = 101 1100 1000 0001 0011 1101 1111 0111 0100 0001 0100 0011 (base 2)
Spaces were used to group digits: for binary, by 4, for decimal, by 3.