Base Ten to Base Two: Unsigned Number 570 427 506 Converted and Written in Base Two. Natural Number (Positive Integer, No Sign) Converted From Decimal System to Binary Code

Base ten unsigned number 570 427 506(10) converted and written as a base two binary code

1. Divide the number repeatedly by 2:

Keep track of each remainder.

Stop when getting a quotient that is equal to zero.


  • division = quotient + remainder;
  • 570 427 506 ÷ 2 = 285 213 753 + 0;
  • 285 213 753 ÷ 2 = 142 606 876 + 1;
  • 142 606 876 ÷ 2 = 71 303 438 + 0;
  • 71 303 438 ÷ 2 = 35 651 719 + 0;
  • 35 651 719 ÷ 2 = 17 825 859 + 1;
  • 17 825 859 ÷ 2 = 8 912 929 + 1;
  • 8 912 929 ÷ 2 = 4 456 464 + 1;
  • 4 456 464 ÷ 2 = 2 228 232 + 0;
  • 2 228 232 ÷ 2 = 1 114 116 + 0;
  • 1 114 116 ÷ 2 = 557 058 + 0;
  • 557 058 ÷ 2 = 278 529 + 0;
  • 278 529 ÷ 2 = 139 264 + 1;
  • 139 264 ÷ 2 = 69 632 + 0;
  • 69 632 ÷ 2 = 34 816 + 0;
  • 34 816 ÷ 2 = 17 408 + 0;
  • 17 408 ÷ 2 = 8 704 + 0;
  • 8 704 ÷ 2 = 4 352 + 0;
  • 4 352 ÷ 2 = 2 176 + 0;
  • 2 176 ÷ 2 = 1 088 + 0;
  • 1 088 ÷ 2 = 544 + 0;
  • 544 ÷ 2 = 272 + 0;
  • 272 ÷ 2 = 136 + 0;
  • 136 ÷ 2 = 68 + 0;
  • 68 ÷ 2 = 34 + 0;
  • 34 ÷ 2 = 17 + 0;
  • 17 ÷ 2 = 8 + 1;
  • 8 ÷ 2 = 4 + 0;
  • 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.

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

570 427 506(10) = 10 0010 0000 0000 0000 1000 0111 0010(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 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)