Convert 1 011 100 101 011 009 970 to Unsigned Binary (Base 2)

See below how to convert 1 011 100 101 011 009 970(10), the unsigned base 10 decimal system number to base 2 binary equivalent

What are the required steps to convert base 10 decimal system
number 1 011 100 101 011 009 970 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;
  • 1 011 100 101 011 009 970 ÷ 2 = 505 550 050 505 504 985 + 0;
  • 505 550 050 505 504 985 ÷ 2 = 252 775 025 252 752 492 + 1;
  • 252 775 025 252 752 492 ÷ 2 = 126 387 512 626 376 246 + 0;
  • 126 387 512 626 376 246 ÷ 2 = 63 193 756 313 188 123 + 0;
  • 63 193 756 313 188 123 ÷ 2 = 31 596 878 156 594 061 + 1;
  • 31 596 878 156 594 061 ÷ 2 = 15 798 439 078 297 030 + 1;
  • 15 798 439 078 297 030 ÷ 2 = 7 899 219 539 148 515 + 0;
  • 7 899 219 539 148 515 ÷ 2 = 3 949 609 769 574 257 + 1;
  • 3 949 609 769 574 257 ÷ 2 = 1 974 804 884 787 128 + 1;
  • 1 974 804 884 787 128 ÷ 2 = 987 402 442 393 564 + 0;
  • 987 402 442 393 564 ÷ 2 = 493 701 221 196 782 + 0;
  • 493 701 221 196 782 ÷ 2 = 246 850 610 598 391 + 0;
  • 246 850 610 598 391 ÷ 2 = 123 425 305 299 195 + 1;
  • 123 425 305 299 195 ÷ 2 = 61 712 652 649 597 + 1;
  • 61 712 652 649 597 ÷ 2 = 30 856 326 324 798 + 1;
  • 30 856 326 324 798 ÷ 2 = 15 428 163 162 399 + 0;
  • 15 428 163 162 399 ÷ 2 = 7 714 081 581 199 + 1;
  • 7 714 081 581 199 ÷ 2 = 3 857 040 790 599 + 1;
  • 3 857 040 790 599 ÷ 2 = 1 928 520 395 299 + 1;
  • 1 928 520 395 299 ÷ 2 = 964 260 197 649 + 1;
  • 964 260 197 649 ÷ 2 = 482 130 098 824 + 1;
  • 482 130 098 824 ÷ 2 = 241 065 049 412 + 0;
  • 241 065 049 412 ÷ 2 = 120 532 524 706 + 0;
  • 120 532 524 706 ÷ 2 = 60 266 262 353 + 0;
  • 60 266 262 353 ÷ 2 = 30 133 131 176 + 1;
  • 30 133 131 176 ÷ 2 = 15 066 565 588 + 0;
  • 15 066 565 588 ÷ 2 = 7 533 282 794 + 0;
  • 7 533 282 794 ÷ 2 = 3 766 641 397 + 0;
  • 3 766 641 397 ÷ 2 = 1 883 320 698 + 1;
  • 1 883 320 698 ÷ 2 = 941 660 349 + 0;
  • 941 660 349 ÷ 2 = 470 830 174 + 1;
  • 470 830 174 ÷ 2 = 235 415 087 + 0;
  • 235 415 087 ÷ 2 = 117 707 543 + 1;
  • 117 707 543 ÷ 2 = 58 853 771 + 1;
  • 58 853 771 ÷ 2 = 29 426 885 + 1;
  • 29 426 885 ÷ 2 = 14 713 442 + 1;
  • 14 713 442 ÷ 2 = 7 356 721 + 0;
  • 7 356 721 ÷ 2 = 3 678 360 + 1;
  • 3 678 360 ÷ 2 = 1 839 180 + 0;
  • 1 839 180 ÷ 2 = 919 590 + 0;
  • 919 590 ÷ 2 = 459 795 + 0;
  • 459 795 ÷ 2 = 229 897 + 1;
  • 229 897 ÷ 2 = 114 948 + 1;
  • 114 948 ÷ 2 = 57 474 + 0;
  • 57 474 ÷ 2 = 28 737 + 0;
  • 28 737 ÷ 2 = 14 368 + 1;
  • 14 368 ÷ 2 = 7 184 + 0;
  • 7 184 ÷ 2 = 3 592 + 0;
  • 3 592 ÷ 2 = 1 796 + 0;
  • 1 796 ÷ 2 = 898 + 0;
  • 898 ÷ 2 = 449 + 0;
  • 449 ÷ 2 = 224 + 1;
  • 224 ÷ 2 = 112 + 0;
  • 112 ÷ 2 = 56 + 0;
  • 56 ÷ 2 = 28 + 0;
  • 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.

1 011 100 101 011 009 970(10) Base 10 decimal system number converted and written as a base 2 unsigned binary equivalent:

1 011 100 101 011 009 970 (base 10) = 1110 0000 1000 0010 0110 0010 1111 0101 0001 0001 1111 0111 0001 1011 0010 (base 2)

Spaces were used to group digits: for binary, by 4, for decimal, by 3.

How to convert unsigned integer numbers (positive) from decimal system (base 10) to binary = simply convert from base 10 to base 2

Follow the steps below to convert a base ten unsigned integer number to base two:

  • 1. Divide repeatedly by 2 the positive integer number that has to be converted to binary, keeping track of each remainder, until we get a QUOTIENT that is equal to ZERO.
  • 2. Construct the base 2 representation of the positive integer number, by taking all the remainders starting from the bottom of the list constructed above. Thus, the last remainder of the divisions becomes the first symbol (the leftmost) of the base two number, while the first remainder becomes the last symbol (the rightmost).

Example: convert the positive integer number 55 from decimal system (base ten) to binary code (base two):

  • 1. Divide repeatedly 55 by 2, keeping track of each remainder, until we get a quotient that is equal to zero:
    • division = quotient + remainder;
    • 55 ÷ 2 = 27 + 1;
    • 27 ÷ 2 = 13 + 1;
    • 13 ÷ 2 = 6 + 1;
    • 6 ÷ 2 = 3 + 0;
    • 3 ÷ 2 = 1 + 1;
    • 1 ÷ 2 = 0 + 1;
  • 2. Construct the base 2 representation of the positive integer number, by taking all the remainders starting from the bottom of the list constructed above:
  • 55(10) = 11 0111(2)
  • Number 5510, positive integer (no sign), converted from decimal system (base 10) to unsigned binary (base 2) = 11 0111(2)
}?>