Convert 9 223 372 032 559 808 331 to Unsigned Binary (Base 2)

See below how to convert 9 223 372 032 559 808 331(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 9 223 372 032 559 808 331 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;
  • 9 223 372 032 559 808 331 ÷ 2 = 4 611 686 016 279 904 165 + 1;
  • 4 611 686 016 279 904 165 ÷ 2 = 2 305 843 008 139 952 082 + 1;
  • 2 305 843 008 139 952 082 ÷ 2 = 1 152 921 504 069 976 041 + 0;
  • 1 152 921 504 069 976 041 ÷ 2 = 576 460 752 034 988 020 + 1;
  • 576 460 752 034 988 020 ÷ 2 = 288 230 376 017 494 010 + 0;
  • 288 230 376 017 494 010 ÷ 2 = 144 115 188 008 747 005 + 0;
  • 144 115 188 008 747 005 ÷ 2 = 72 057 594 004 373 502 + 1;
  • 72 057 594 004 373 502 ÷ 2 = 36 028 797 002 186 751 + 0;
  • 36 028 797 002 186 751 ÷ 2 = 18 014 398 501 093 375 + 1;
  • 18 014 398 501 093 375 ÷ 2 = 9 007 199 250 546 687 + 1;
  • 9 007 199 250 546 687 ÷ 2 = 4 503 599 625 273 343 + 1;
  • 4 503 599 625 273 343 ÷ 2 = 2 251 799 812 636 671 + 1;
  • 2 251 799 812 636 671 ÷ 2 = 1 125 899 906 318 335 + 1;
  • 1 125 899 906 318 335 ÷ 2 = 562 949 953 159 167 + 1;
  • 562 949 953 159 167 ÷ 2 = 281 474 976 579 583 + 1;
  • 281 474 976 579 583 ÷ 2 = 140 737 488 289 791 + 1;
  • 140 737 488 289 791 ÷ 2 = 70 368 744 144 895 + 1;
  • 70 368 744 144 895 ÷ 2 = 35 184 372 072 447 + 1;
  • 35 184 372 072 447 ÷ 2 = 17 592 186 036 223 + 1;
  • 17 592 186 036 223 ÷ 2 = 8 796 093 018 111 + 1;
  • 8 796 093 018 111 ÷ 2 = 4 398 046 509 055 + 1;
  • 4 398 046 509 055 ÷ 2 = 2 199 023 254 527 + 1;
  • 2 199 023 254 527 ÷ 2 = 1 099 511 627 263 + 1;
  • 1 099 511 627 263 ÷ 2 = 549 755 813 631 + 1;
  • 549 755 813 631 ÷ 2 = 274 877 906 815 + 1;
  • 274 877 906 815 ÷ 2 = 137 438 953 407 + 1;
  • 137 438 953 407 ÷ 2 = 68 719 476 703 + 1;
  • 68 719 476 703 ÷ 2 = 34 359 738 351 + 1;
  • 34 359 738 351 ÷ 2 = 17 179 869 175 + 1;
  • 17 179 869 175 ÷ 2 = 8 589 934 587 + 1;
  • 8 589 934 587 ÷ 2 = 4 294 967 293 + 1;
  • 4 294 967 293 ÷ 2 = 2 147 483 646 + 1;
  • 2 147 483 646 ÷ 2 = 1 073 741 823 + 0;
  • 1 073 741 823 ÷ 2 = 536 870 911 + 1;
  • 536 870 911 ÷ 2 = 268 435 455 + 1;
  • 268 435 455 ÷ 2 = 134 217 727 + 1;
  • 134 217 727 ÷ 2 = 67 108 863 + 1;
  • 67 108 863 ÷ 2 = 33 554 431 + 1;
  • 33 554 431 ÷ 2 = 16 777 215 + 1;
  • 16 777 215 ÷ 2 = 8 388 607 + 1;
  • 8 388 607 ÷ 2 = 4 194 303 + 1;
  • 4 194 303 ÷ 2 = 2 097 151 + 1;
  • 2 097 151 ÷ 2 = 1 048 575 + 1;
  • 1 048 575 ÷ 2 = 524 287 + 1;
  • 524 287 ÷ 2 = 262 143 + 1;
  • 262 143 ÷ 2 = 131 071 + 1;
  • 131 071 ÷ 2 = 65 535 + 1;
  • 65 535 ÷ 2 = 32 767 + 1;
  • 32 767 ÷ 2 = 16 383 + 1;
  • 16 383 ÷ 2 = 8 191 + 1;
  • 8 191 ÷ 2 = 4 095 + 1;
  • 4 095 ÷ 2 = 2 047 + 1;
  • 2 047 ÷ 2 = 1 023 + 1;
  • 1 023 ÷ 2 = 511 + 1;
  • 511 ÷ 2 = 255 + 1;
  • 255 ÷ 2 = 127 + 1;
  • 127 ÷ 2 = 63 + 1;
  • 63 ÷ 2 = 31 + 1;
  • 31 ÷ 2 = 15 + 1;
  • 15 ÷ 2 = 7 + 1;
  • 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.

9 223 372 032 559 808 331(10) Base 10 decimal system number converted and written as a base 2 unsigned binary equivalent:

9 223 372 032 559 808 331 (base 10) = 111 1111 1111 1111 1111 1111 1111 1110 1111 1111 1111 1111 1111 1111 0100 1011 (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)