What is the binary equivalent of the decimal number 140?

What is the binary equivalent of the decimal number 140?

• A. 10001000
• B. 10001100
• C. 10101100
• D. 11001100

Answer: (B)

To find the binary equivalent of the decimal number 140, one can use the method of repeatedly dividing the number by 2 and recording the remainders. Starting with 140: 1. Divide 140 by 2, the quotient is 70 and the remainder is 0. 2. Divide 70 by 2, the quotient is 35 and the remainder is 0. 3. Divide 35 by 2, the quotient is 17 and the remainder is 1. 4. Divide 17 by 2, the quotient is 8 and the remainder is 1. 5. Divide 8 by 2, the quotient is 4 and the remainder is 0. 6. Divide 4 by 2, the quotient is 2 and the remainder is 0. 7. Divide 2 by 2, the quotient is 1 and the remainder is 0. 8. Finally, divide 1 by 2, the quotient is 0 and the remainder is 1. The remainders, read in reverse order from the last division to the first, give the binary representation. Thus, the remainders from bottom to top are 1, 0, 0,

To find the binary equivalent of the decimal number 140, one can use the method of repeatedly dividing the number by 2 and recording the remainders.

Starting with 140:

1. Divide 140 by 2, the quotient is 70 and the remainder is 0.

2. Divide 70 by 2, the quotient is 35 and the remainder is 0.

3. Divide 35 by 2, the quotient is 17 and the remainder is 1.

4. Divide 17 by 2, the quotient is 8 and the remainder is 1.

5. Divide 8 by 2, the quotient is 4 and the remainder is 0.

6. Divide 4 by 2, the quotient is 2 and the remainder is 0.

7. Divide 2 by 2, the quotient is 1 and the remainder is 0.

8. Finally, divide 1 by 2, the quotient is 0 and the remainder is 1.

The remainders, read in reverse order from the last division to the first, give the binary representation. Thus, the remainders from bottom to top are 1, 0, 0,