Convert 349 313 217 to Unsigned Binary (Base 2)

See below how to convert 349 313 217(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 349 313 217 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;
  • 349 313 217 ÷ 2 = 174 656 608 + 1;
  • 174 656 608 ÷ 2 = 87 328 304 + 0;
  • 87 328 304 ÷ 2 = 43 664 152 + 0;
  • 43 664 152 ÷ 2 = 21 832 076 + 0;
  • 21 832 076 ÷ 2 = 10 916 038 + 0;
  • 10 916 038 ÷ 2 = 5 458 019 + 0;
  • 5 458 019 ÷ 2 = 2 729 009 + 1;
  • 2 729 009 ÷ 2 = 1 364 504 + 1;
  • 1 364 504 ÷ 2 = 682 252 + 0;
  • 682 252 ÷ 2 = 341 126 + 0;
  • 341 126 ÷ 2 = 170 563 + 0;
  • 170 563 ÷ 2 = 85 281 + 1;
  • 85 281 ÷ 2 = 42 640 + 1;
  • 42 640 ÷ 2 = 21 320 + 0;
  • 21 320 ÷ 2 = 10 660 + 0;
  • 10 660 ÷ 2 = 5 330 + 0;
  • 5 330 ÷ 2 = 2 665 + 0;
  • 2 665 ÷ 2 = 1 332 + 1;
  • 1 332 ÷ 2 = 666 + 0;
  • 666 ÷ 2 = 333 + 0;
  • 333 ÷ 2 = 166 + 1;
  • 166 ÷ 2 = 83 + 0;
  • 83 ÷ 2 = 41 + 1;
  • 41 ÷ 2 = 20 + 1;
  • 20 ÷ 2 = 10 + 0;
  • 10 ÷ 2 = 5 + 0;
  • 5 ÷ 2 = 2 + 1;
  • 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.

349 313 217(10) Base 10 decimal system number converted and written as a base 2 unsigned binary equivalent:

349 313 217 (base 10) = 1 0100 1101 0010 0001 1000 1100 0001 (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)
}?>