Unsigned: Integer ↗ Binary: 4 000 000 000 000 000 000 Convert the Positive Integer (Whole Number) From Base Ten (10) To Base Two (2), Conversion and Writing of Decimal System Number as Unsigned Binary Code

Unsigned (positive) integer number 4 000 000 000 000 000 000(10)
converted and written as an unsigned binary (base 2) = ?

1. Divide the number repeatedly by 2:

Keep track of each remainder.

We stop when we get a quotient that is equal to zero.

  • division = quotient + remainder;
  • 4 000 000 000 000 000 000 ÷ 2 = 2 000 000 000 000 000 000 + 0;
  • 2 000 000 000 000 000 000 ÷ 2 = 1 000 000 000 000 000 000 + 0;
  • 1 000 000 000 000 000 000 ÷ 2 = 500 000 000 000 000 000 + 0;
  • 500 000 000 000 000 000 ÷ 2 = 250 000 000 000 000 000 + 0;
  • 250 000 000 000 000 000 ÷ 2 = 125 000 000 000 000 000 + 0;
  • 125 000 000 000 000 000 ÷ 2 = 62 500 000 000 000 000 + 0;
  • 62 500 000 000 000 000 ÷ 2 = 31 250 000 000 000 000 + 0;
  • 31 250 000 000 000 000 ÷ 2 = 15 625 000 000 000 000 + 0;
  • 15 625 000 000 000 000 ÷ 2 = 7 812 500 000 000 000 + 0;
  • 7 812 500 000 000 000 ÷ 2 = 3 906 250 000 000 000 + 0;
  • 3 906 250 000 000 000 ÷ 2 = 1 953 125 000 000 000 + 0;
  • 1 953 125 000 000 000 ÷ 2 = 976 562 500 000 000 + 0;
  • 976 562 500 000 000 ÷ 2 = 488 281 250 000 000 + 0;
  • 488 281 250 000 000 ÷ 2 = 244 140 625 000 000 + 0;
  • 244 140 625 000 000 ÷ 2 = 122 070 312 500 000 + 0;
  • 122 070 312 500 000 ÷ 2 = 61 035 156 250 000 + 0;
  • 61 035 156 250 000 ÷ 2 = 30 517 578 125 000 + 0;
  • 30 517 578 125 000 ÷ 2 = 15 258 789 062 500 + 0;
  • 15 258 789 062 500 ÷ 2 = 7 629 394 531 250 + 0;
  • 7 629 394 531 250 ÷ 2 = 3 814 697 265 625 + 0;
  • 3 814 697 265 625 ÷ 2 = 1 907 348 632 812 + 1;
  • 1 907 348 632 812 ÷ 2 = 953 674 316 406 + 0;
  • 953 674 316 406 ÷ 2 = 476 837 158 203 + 0;
  • 476 837 158 203 ÷ 2 = 238 418 579 101 + 1;
  • 238 418 579 101 ÷ 2 = 119 209 289 550 + 1;
  • 119 209 289 550 ÷ 2 = 59 604 644 775 + 0;
  • 59 604 644 775 ÷ 2 = 29 802 322 387 + 1;
  • 29 802 322 387 ÷ 2 = 14 901 161 193 + 1;
  • 14 901 161 193 ÷ 2 = 7 450 580 596 + 1;
  • 7 450 580 596 ÷ 2 = 3 725 290 298 + 0;
  • 3 725 290 298 ÷ 2 = 1 862 645 149 + 0;
  • 1 862 645 149 ÷ 2 = 931 322 574 + 1;
  • 931 322 574 ÷ 2 = 465 661 287 + 0;
  • 465 661 287 ÷ 2 = 232 830 643 + 1;
  • 232 830 643 ÷ 2 = 116 415 321 + 1;
  • 116 415 321 ÷ 2 = 58 207 660 + 1;
  • 58 207 660 ÷ 2 = 29 103 830 + 0;
  • 29 103 830 ÷ 2 = 14 551 915 + 0;
  • 14 551 915 ÷ 2 = 7 275 957 + 1;
  • 7 275 957 ÷ 2 = 3 637 978 + 1;
  • 3 637 978 ÷ 2 = 1 818 989 + 0;
  • 1 818 989 ÷ 2 = 909 494 + 1;
  • 909 494 ÷ 2 = 454 747 + 0;
  • 454 747 ÷ 2 = 227 373 + 1;
  • 227 373 ÷ 2 = 113 686 + 1;
  • 113 686 ÷ 2 = 56 843 + 0;
  • 56 843 ÷ 2 = 28 421 + 1;
  • 28 421 ÷ 2 = 14 210 + 1;
  • 14 210 ÷ 2 = 7 105 + 0;
  • 7 105 ÷ 2 = 3 552 + 1;
  • 3 552 ÷ 2 = 1 776 + 0;
  • 1 776 ÷ 2 = 888 + 0;
  • 888 ÷ 2 = 444 + 0;
  • 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.


Number 4 000 000 000 000 000 000(10), a positive integer number (with no sign),
converted from decimal system (from base 10)
and written as an unsigned binary (in base 2):

4 000 000 000 000 000 000(10) = 11 0111 1000 0010 1101 1010 1100 1110 1001 1101 1001 0000 0000 0000 0000 0000(2)

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

The latest positive (unsigned) integer numbers converted from decimal system (written in base ten) to unsigned binary (written in base two)

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

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)