- Division method is used to convert only integer part of a decimal number to its equivalent in binary number system.
- In this method the integer part of the decimal number is continuously divided until we reach a stage where the quotient becomes zero.
- The reminder that we obtain at each division iteration becomes the value of the weights or the digits in the binary number system.
- The reminders that we obtain are taken from the last step to first step i.e. the last reminder obtained during the division iteration is the most significant digit (
**MSD**) and the first reminder the we obtained is the least significant digit in the binary number system. - You will understand the procedure better with the following illustrative example.

__Convert (32)__

**Ex1:**_{10}decimal number to binary number (?)

_{2}using division method

**1st Division Iteration**Divide 32 by 2

32 ÷ 2 = 16(Quotient) Reminder:0

**2nd Division Iteration**Divide 16 by 2

16 ÷ 2 = 8(Quotient) Reminder=0

**3rd Division Iteration**Divide 8 by 2

8 ÷ 2 = 4(Quotient) Reminder=0

**4th Division Iteration**Divide 4 by 2

4 ÷ 2 = 2(Quotient) Reminder=0

Remainder from the last division iteration becomes

**5th Division Iteration**
Divide 2 by 2

2 ÷ 2 = 1(Quotient) Reminder=0

**6th Division Iteration**
Divide 1 by 2

1 ÷ 2 = 0(Quotient) Reminder=1**MSD**and reminder from 1st iteration becomes

**LSD**.

Hence, the binary equivalent of the decimal number

**32**is (

**100000).**