Convert base ten decimal system unsigned (positive) integer number to unsigned binary (base two)

Please check the form fields values.
Unsigned (positive) integer: empty

Convert positive integer numbers (unsigned) from the decimal system (base ten) to binary (base two)

How to convert a base ten positive integer number to base two:

1) Divide the number repeatedly by 2, keeping track of each remainder, until we get a quotient that is ZERO;

2) Construct the base 2 representation by taking all the previously calculated remainders starting from the last remainder up to the first one, in that order.

Latest positive integer numbers (unsigned) converted from decimal (base ten) to unsigned binary (base two)

29 = 1 1101 Apr 22 21:50 UTC (GMT)
157 = 1001 1101 Apr 22 21:47 UTC (GMT)
157 = 1001 1101 Apr 22 21:47 UTC (GMT)
1 027 = 100 0000 0011 Apr 22 21:36 UTC (GMT)
4 586 = 1 0001 1110 1010 Apr 22 21:32 UTC (GMT)
188 = 1011 1100 Apr 22 21:31 UTC (GMT)
9 217 = 10 0100 0000 0001 Apr 22 21:26 UTC (GMT)
10 950 = 10 1010 1100 0110 Apr 22 21:19 UTC (GMT)
110 = 110 1110 Apr 22 21:17 UTC (GMT)
239 = 1110 1111 Apr 22 21:12 UTC (GMT)
110 000 110 101 000 000 = 1 1000 0110 1100 1100 1000 0100 0110 1111 1101 0010 1110 1111 0100 0000 Apr 22 21:08 UTC (GMT)
360 = 1 0110 1000 Apr 22 21:08 UTC (GMT)
16 385 = 100 0000 0000 0001 Apr 22 21:07 UTC (GMT)
All decimal positive integers converted to unsigned binary (base 2)

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)