Convert 1 001 010 101 010 009 942 to Unsigned Binary (Base 2)

See below how to convert 1 001 010 101 010 009 942(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 001 010 101 010 009 942 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 001 010 101 010 009 942 ÷ 2 = 500 505 050 505 004 971 + 0;
  • 500 505 050 505 004 971 ÷ 2 = 250 252 525 252 502 485 + 1;
  • 250 252 525 252 502 485 ÷ 2 = 125 126 262 626 251 242 + 1;
  • 125 126 262 626 251 242 ÷ 2 = 62 563 131 313 125 621 + 0;
  • 62 563 131 313 125 621 ÷ 2 = 31 281 565 656 562 810 + 1;
  • 31 281 565 656 562 810 ÷ 2 = 15 640 782 828 281 405 + 0;
  • 15 640 782 828 281 405 ÷ 2 = 7 820 391 414 140 702 + 1;
  • 7 820 391 414 140 702 ÷ 2 = 3 910 195 707 070 351 + 0;
  • 3 910 195 707 070 351 ÷ 2 = 1 955 097 853 535 175 + 1;
  • 1 955 097 853 535 175 ÷ 2 = 977 548 926 767 587 + 1;
  • 977 548 926 767 587 ÷ 2 = 488 774 463 383 793 + 1;
  • 488 774 463 383 793 ÷ 2 = 244 387 231 691 896 + 1;
  • 244 387 231 691 896 ÷ 2 = 122 193 615 845 948 + 0;
  • 122 193 615 845 948 ÷ 2 = 61 096 807 922 974 + 0;
  • 61 096 807 922 974 ÷ 2 = 30 548 403 961 487 + 0;
  • 30 548 403 961 487 ÷ 2 = 15 274 201 980 743 + 1;
  • 15 274 201 980 743 ÷ 2 = 7 637 100 990 371 + 1;
  • 7 637 100 990 371 ÷ 2 = 3 818 550 495 185 + 1;
  • 3 818 550 495 185 ÷ 2 = 1 909 275 247 592 + 1;
  • 1 909 275 247 592 ÷ 2 = 954 637 623 796 + 0;
  • 954 637 623 796 ÷ 2 = 477 318 811 898 + 0;
  • 477 318 811 898 ÷ 2 = 238 659 405 949 + 0;
  • 238 659 405 949 ÷ 2 = 119 329 702 974 + 1;
  • 119 329 702 974 ÷ 2 = 59 664 851 487 + 0;
  • 59 664 851 487 ÷ 2 = 29 832 425 743 + 1;
  • 29 832 425 743 ÷ 2 = 14 916 212 871 + 1;
  • 14 916 212 871 ÷ 2 = 7 458 106 435 + 1;
  • 7 458 106 435 ÷ 2 = 3 729 053 217 + 1;
  • 3 729 053 217 ÷ 2 = 1 864 526 608 + 1;
  • 1 864 526 608 ÷ 2 = 932 263 304 + 0;
  • 932 263 304 ÷ 2 = 466 131 652 + 0;
  • 466 131 652 ÷ 2 = 233 065 826 + 0;
  • 233 065 826 ÷ 2 = 116 532 913 + 0;
  • 116 532 913 ÷ 2 = 58 266 456 + 1;
  • 58 266 456 ÷ 2 = 29 133 228 + 0;
  • 29 133 228 ÷ 2 = 14 566 614 + 0;
  • 14 566 614 ÷ 2 = 7 283 307 + 0;
  • 7 283 307 ÷ 2 = 3 641 653 + 1;
  • 3 641 653 ÷ 2 = 1 820 826 + 1;
  • 1 820 826 ÷ 2 = 910 413 + 0;
  • 910 413 ÷ 2 = 455 206 + 1;
  • 455 206 ÷ 2 = 227 603 + 0;
  • 227 603 ÷ 2 = 113 801 + 1;
  • 113 801 ÷ 2 = 56 900 + 1;
  • 56 900 ÷ 2 = 28 450 + 0;
  • 28 450 ÷ 2 = 14 225 + 0;
  • 14 225 ÷ 2 = 7 112 + 1;
  • 7 112 ÷ 2 = 3 556 + 0;
  • 3 556 ÷ 2 = 1 778 + 0;
  • 1 778 ÷ 2 = 889 + 0;
  • 889 ÷ 2 = 444 + 1;
  • 444 ÷ 2 = 222 + 0;
  • 222 ÷ 2 = 111 + 0;
  • 111 ÷ 2 = 55 + 1;
  • 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 number:

Take all the remainders starting from the bottom of the list constructed above.

1 001 010 101 010 009 942(10) Base 10 decimal system number converted and written as a base 2 unsigned binary equivalent:

1 001 010 101 010 009 942 (base 10) = 1101 1110 0100 0100 1101 0110 0010 0001 1111 0100 0111 1000 1111 0101 0110 (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)