65536
Only up to 3999
10000000000000000
The number 65536 — factors and divisors
Deficient
65,536 = 2¹⁶. It has 17 divisors, adding up to 131,071.
Its divisors, itself excluded, add up to less than the number.
Families it belongs to
Square
A number times itself — the dots lay out as a square.
Power of two
Two multiplied by itself. Every extra bit doubles it.
Laid out as dots
It fits as 256 × 256. The more divisors, the closer to a square.
- Prime factors
- 2¹⁶
- Divisors
- 1, 2, 4, 8, 16, 32, 64, 128, 256, 512, 1024, 2048, 4096, 8192, 16384, 32768, 65536
- Sum of divisors
- 131,071
- Sum without itself
- 65,535
- Coprime below it
- 32,768
- Digit sum
- 25
- Digital root
- 7
- Roman numeral
- Only up to 3999
- Binary
- 10000000000000000
- Octal
- 200000
- Hexadecimal
- 10000
- Base 36
- 1EKG
- Bits
- 17 bits
- Collatz steps
- 16 steps · peaks at 65,536
- Prime before
- 65521
- Prime after
- 65537
Numbers either side
How to read this
- The prime factors are what the number is made of. The count and sum of divisors both follow from them.
- Add the divisors, take the number away, and you get perfect, abundant or deficient.
- The length of the binary form is the bit count. 255 taking eight digits is what a byte is.
- Collatz: halve it if even, triple it and add one if odd. The count is how many moves reach 1.
Frequently asked questions
Q. Is 65,536 a prime number?
No. It breaks down into 2¹⁶.
Q. What are the divisors of 65,536?
1, 2, 4, 8, 16, 32, 64, 128, 256, 512, 1024, 2048, 4096, 8192, 16384, 32768, 65536 — 17 divisors in all, adding up to 131,071.
Q. How is 65,536 written in binary?
10000000000000000, which is 17 bits. In hexadecimal it is 10000.
Q. How many Collatz steps does 65,536 take?
It reaches 1 in 16, peaking at 65,536 on the way.