Convert 11 010 101 111 001 011 150 to Unsigned Binary (Base 2)

See below how to convert 11 010 101 111 001 011 150(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 11 010 101 111 001 011 150 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 010 101 111 001 011 150 ÷ 2 = 5 505 050 555 500 505 575 + 0;
  • 5 505 050 555 500 505 575 ÷ 2 = 2 752 525 277 750 252 787 + 1;
  • 2 752 525 277 750 252 787 ÷ 2 = 1 376 262 638 875 126 393 + 1;
  • 1 376 262 638 875 126 393 ÷ 2 = 688 131 319 437 563 196 + 1;
  • 688 131 319 437 563 196 ÷ 2 = 344 065 659 718 781 598 + 0;
  • 344 065 659 718 781 598 ÷ 2 = 172 032 829 859 390 799 + 0;
  • 172 032 829 859 390 799 ÷ 2 = 86 016 414 929 695 399 + 1;
  • 86 016 414 929 695 399 ÷ 2 = 43 008 207 464 847 699 + 1;
  • 43 008 207 464 847 699 ÷ 2 = 21 504 103 732 423 849 + 1;
  • 21 504 103 732 423 849 ÷ 2 = 10 752 051 866 211 924 + 1;
  • 10 752 051 866 211 924 ÷ 2 = 5 376 025 933 105 962 + 0;
  • 5 376 025 933 105 962 ÷ 2 = 2 688 012 966 552 981 + 0;
  • 2 688 012 966 552 981 ÷ 2 = 1 344 006 483 276 490 + 1;
  • 1 344 006 483 276 490 ÷ 2 = 672 003 241 638 245 + 0;
  • 672 003 241 638 245 ÷ 2 = 336 001 620 819 122 + 1;
  • 336 001 620 819 122 ÷ 2 = 168 000 810 409 561 + 0;
  • 168 000 810 409 561 ÷ 2 = 84 000 405 204 780 + 1;
  • 84 000 405 204 780 ÷ 2 = 42 000 202 602 390 + 0;
  • 42 000 202 602 390 ÷ 2 = 21 000 101 301 195 + 0;
  • 21 000 101 301 195 ÷ 2 = 10 500 050 650 597 + 1;
  • 10 500 050 650 597 ÷ 2 = 5 250 025 325 298 + 1;
  • 5 250 025 325 298 ÷ 2 = 2 625 012 662 649 + 0;
  • 2 625 012 662 649 ÷ 2 = 1 312 506 331 324 + 1;
  • 1 312 506 331 324 ÷ 2 = 656 253 165 662 + 0;
  • 656 253 165 662 ÷ 2 = 328 126 582 831 + 0;
  • 328 126 582 831 ÷ 2 = 164 063 291 415 + 1;
  • 164 063 291 415 ÷ 2 = 82 031 645 707 + 1;
  • 82 031 645 707 ÷ 2 = 41 015 822 853 + 1;
  • 41 015 822 853 ÷ 2 = 20 507 911 426 + 1;
  • 20 507 911 426 ÷ 2 = 10 253 955 713 + 0;
  • 10 253 955 713 ÷ 2 = 5 126 977 856 + 1;
  • 5 126 977 856 ÷ 2 = 2 563 488 928 + 0;
  • 2 563 488 928 ÷ 2 = 1 281 744 464 + 0;
  • 1 281 744 464 ÷ 2 = 640 872 232 + 0;
  • 640 872 232 ÷ 2 = 320 436 116 + 0;
  • 320 436 116 ÷ 2 = 160 218 058 + 0;
  • 160 218 058 ÷ 2 = 80 109 029 + 0;
  • 80 109 029 ÷ 2 = 40 054 514 + 1;
  • 40 054 514 ÷ 2 = 20 027 257 + 0;
  • 20 027 257 ÷ 2 = 10 013 628 + 1;
  • 10 013 628 ÷ 2 = 5 006 814 + 0;
  • 5 006 814 ÷ 2 = 2 503 407 + 0;
  • 2 503 407 ÷ 2 = 1 251 703 + 1;
  • 1 251 703 ÷ 2 = 625 851 + 1;
  • 625 851 ÷ 2 = 312 925 + 1;
  • 312 925 ÷ 2 = 156 462 + 1;
  • 156 462 ÷ 2 = 78 231 + 0;
  • 78 231 ÷ 2 = 39 115 + 1;
  • 39 115 ÷ 2 = 19 557 + 1;
  • 19 557 ÷ 2 = 9 778 + 1;
  • 9 778 ÷ 2 = 4 889 + 0;
  • 4 889 ÷ 2 = 2 444 + 1;
  • 2 444 ÷ 2 = 1 222 + 0;
  • 1 222 ÷ 2 = 611 + 0;
  • 611 ÷ 2 = 305 + 1;
  • 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 010 101 111 001 011 150(10) Base 10 decimal system number converted and written as a base 2 unsigned binary equivalent:

11 010 101 111 001 011 150 (base 10) = 1001 1000 1100 1011 1011 1100 1010 0000 0101 1110 0101 1001 0101 0011 1100 1110 (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)