128 in Binary — What is 128 in Binary?

128 in binary is 10000000. 128 = 2^7, so its binary form is a 1 followed by 7 zero(s). In octal 128 is 200 and in hexadecimal it is 80. The bit pattern uses 8 bits and fits in 1 byte....

128 IN ALL BASES

128 IN BINARY

10000000

8 bits · 1 byte · 1 one

Binary (base 2)

10000000

Octal (base 8)

200

Decimal (base 10)

128

Hexadecimal (base 16)

80

BCD

0001 0010 1000

Bit length

8

Byte count

1

Count of 1s

1

Count of 0s

7

Is power of 2

Yes ✓

Nearest 2ⁿ

2^7

HOW TO CONVERT 128 TO BINARY

Method: divide by 2, collect remainders

1

128 ÷ 2 = 64 remainder 0

2

64 ÷ 2 = 32 remainder 0

3

32 ÷ 2 = 16 remainder 0

4

16 ÷ 2 = 8 remainder 0

5

8 ÷ 2 = 4 remainder 0

6

4 ÷ 2 = 2 remainder 0

7

2 ÷ 2 = 1 remainder 0

8

1 ÷ 2 = 0 remainder 1

Read remainders bottom to top: 10000000

VERIFY: BINARY BACK TO DECIMAL

1×2^7 + 0×2^6 + 0×2^5 + 0×2^4 + 0×2^3 + 0×2^2 + 0×2^1 + 0×2^0

= 128 = 128

FUN FACT

128 = 2^7 is half of 256 and the sign bit in 8-bit signed integers. In binary, 128 = 10000000 — exactly 8 bits. 128.x.x.x was a Class B IPv4 network prefix.

BIT VISUALIZER

BIT PATTERN

Byte 1

1
7
0
6
0
5
0
4
0
3
0
2
0
1
0
0

POWERS OF 2 REFERENCE

n2ⁿBinaryHex
0111
12102
241004
3810008
4161000010
53210000020
664100000040
71281000000080
8256100000000100
95121000000000200
10102410000000000400
153276810000000000000008000
16655361000000000000000010000
Created with❤️byeaglecalculator.com

HOW TO CONVERT

  1. 1

    Divide 128 by 2 repeatedly, collecting remainders: 128 div 2 = 64 remainder 0 -> 64 div 2 = 32 remainder 0 -> 32 div 2 = 16 remainder 0 -> 16 div 2 = 8 remainder 0 -> 8 div 2 = 4 remainder 0 -> 4 div 2 = 2 remainder 0 -> 2 div 2 = 1 remainder 0 -> 1 div 2 = 0 remainder 1. Read remainders bottom to top: 10000000.

  2. 2

    Verify: 1*2^7 + 0*2^6 + 0*2^5 + 0*2^4 + 0*2^3 + 0*2^2 + 0*2^1 + 0*2^0 = 128 = 128. Each bit position represents a power of 2, starting at 2^0 = 1 on the right.

  3. 3

    128 in other bases: octal = 200, hexadecimal = 80. 128 = 2^7, so its binary form is a 1 followed by 7 zero(s).

  4. 4

    The bit pattern uses 8 bits and fits in 1 byte. When stored as a full byte: 10000000.

WORKED EXAMPLE

128 decimal to binary: 128 div 2 = 64 remainder 0 -> 64 div 2 = 32 remainder 0 -> 32 div 2 = 16 remainder 0 -> 16 div 2 = 8 remainder 0 -> 8 div 2 = 4 remainder 0 -> 4 div 2 = 2 remainder 0 -> 2 div 2 = 1 remainder 0 -> 1 div 2 = 0 remainder 1 -> read bottom to top: 10000000. Verify: 1*2^7 + 0*2^6 + 0*2^5 + 0*2^4 + 0*2^3 + 0*2^2 + 0*2^1 + 0*2^0 = 128. Octal: 200, Hex: 80.

FREQUENTLY ASKED QUESTIONS

RELATED

MORE NUMBER THEORY CALCULATORS

Was this calculator helpful?

Last updated: April 29, 2026 · Formula verified by EagleCalculator team · Eagle-eyed accuracy for every calculation.