512
DXII
1000000000
The number 512 — factors and divisors
Deficient
512 = 2⁹. It has 10 divisors, adding up to 1,023.
Its divisors, itself excluded, add up to less than the number.
Families it belongs to
Cube
A number times itself three times — the dots stack into a cube.
Power of two
Two multiplied by itself. Every extra bit doubles it.
Laid out as dots
It fits as 16 × 32. The more divisors, the closer to a square.
- Prime factors
- 2⁹
- Divisors
- 1, 2, 4, 8, 16, 32, 64, 128, 256, 512
- Sum of divisors
- 1,023
- Sum without itself
- 511
- Coprime below it
- 256
- Digit sum
- 8
- Digital root
- 8
- Roman numeral
- DXII
- Binary
- 1000000000
- Octal
- 1000
- Hexadecimal
- 200
- Base 36
- E8
- Bits
- 10 bits
- Collatz steps
- 9 steps · peaks at 512
- Prime before
- 509
- Prime after
- 521
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 512 a prime number?
No. It breaks down into 2⁹.
Q. What are the divisors of 512?
1, 2, 4, 8, 16, 32, 64, 128, 256, 512 — 10 divisors in all, adding up to 1,023.
Q. How is 512 written in binary?
1000000000, which is 10 bits. In hexadecimal it is 200.
Q. How many Collatz steps does 512 take?
It reaches 1 in 9, peaking at 512 on the way.