64 in binary is 1000000. 64 = 2^6, so its binary form is a 1 followed by 6 zero(s). In octal 64 is 100 and in hexadecimal it is 40. The bit pattern uses 7 bits and fits in 1 byte....
64 IN BINARY
1000000
7 bits · 1 byte · 1 one
Binary (base 2)
1000000
Octal (base 8)
100
Decimal (base 10)
64
Hexadecimal (base 16)
40
BCD
0110 0100
Bit length
7
Byte count
1
Count of 1s
1
Count of 0s
6
Is power of 2
Yes ✓
Nearest 2ⁿ
2^6
HOW TO CONVERT 64 TO BINARY
Method: divide by 2, collect remainders
64 ÷ 2 = 32 remainder 0
32 ÷ 2 = 16 remainder 0
16 ÷ 2 = 8 remainder 0
8 ÷ 2 = 4 remainder 0
4 ÷ 2 = 2 remainder 0
2 ÷ 2 = 1 remainder 0
1 ÷ 2 = 0 remainder 1
Read remainders bottom to top: 1000000
VERIFY: BINARY BACK TO DECIMAL
1×2^6 + 0×2^5 + 0×2^4 + 0×2^3 + 0×2^2 + 0×2^1 + 0×2^0
= 64 = 64 ✓
FUN FACT
64 = 2^6 is the base of Base64 encoding and central to 64-bit computing (x86-64). In binary, 64 = 1000000 — seven digits. The modern CPU word size is 64 bits.
BIT PATTERN
Byte 1
POWERS OF 2 REFERENCE
| n | 2ⁿ | Binary | Hex |
|---|---|---|---|
| 0 | 1 | 1 | 1 |
| 1 | 2 | 10 | 2 |
| 2 | 4 | 100 | 4 |
| 3 | 8 | 1000 | 8 |
| 4 | 16 | 10000 | 10 |
| 5 | 32 | 100000 | 20 |
| 6 | 64 | 1000000 | 40 |
| 7 | 128 | 10000000 | 80 |
| 8 | 256 | 100000000 | 100 |
| 9 | 512 | 1000000000 | 200 |
| 10 | 1024 | 10000000000 | 400 |
| 15 | 32768 | 1000000000000000 | 8000 |
| 16 | 65536 | 10000000000000000 | 10000 |
Divide 64 by 2 repeatedly, collecting remainders: 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: 1000000.
Verify: 1*2^6 + 0*2^5 + 0*2^4 + 0*2^3 + 0*2^2 + 0*2^1 + 0*2^0 = 64 = 64. Each bit position represents a power of 2, starting at 2^0 = 1 on the right.
64 in other bases: octal = 100, hexadecimal = 40. 64 = 2^6, so its binary form is a 1 followed by 6 zero(s).
The bit pattern uses 7 bits and fits in 1 byte. When stored as a full byte: 01000000.
64 decimal to binary: 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: 1000000. Verify: 1*2^6 + 0*2^5 + 0*2^4 + 0*2^3 + 0*2^2 + 0*2^1 + 0*2^0 = 64. Octal: 100, Hex: 40.
Hexadecimal Converter
Calculate instantly →
2 in Binary
Calculate instantly →
4 in Binary
Calculate instantly →
Random Number Generator
Calculate instantly →
8 in Binary
Calculate instantly →
16 in Binary
Calculate instantly →
10 in Binary
Calculate instantly →
1 in Binary
Calculate instantly →
255 in Binary
Calculate instantly →
3 in Binary
Calculate instantly →
6 in Binary
Calculate instantly →
9 in Binary
Calculate instantly →
11 in Binary
Calculate instantly →
14 in Binary
Calculate instantly →
128 in Binary
Calculate instantly →
0 in Binary
Calculate instantly →
5 in Binary
Calculate instantly →
7 in Binary
Calculate instantly →
12 in Binary
Calculate instantly →
Binary Converter
Calculate instantly →
Last updated: April 29, 2026 · Formula verified by EagleCalculator team · Eagle-eyed accuracy for every calculation.