Numbers·32
32
XXXII
100000

The number 32 — factors and divisors

Deficient

32 = 2⁵. It has 6 divisors, adding up to 63.

Its divisors, itself excluded, add up to less than the number.

Families it belongs to

Power of two

Two multiplied by itself. Every extra bit doubles it.

Laid out as dots

It fits as 4 × 8. The more divisors, the closer to a square.

Prime factors
2⁵
Divisors
1, 2, 4, 8, 16, 32
Sum of divisors
63
Sum without itself
31
Coprime below it
16
Digit sum
5
Digital root
5
Roman numeral
XXXII
Binary
100000
Octal
40
Hexadecimal
20
Base 36
W
Bits
6 bits
Collatz steps
5 steps · peaks at 32
Prime before
31
Prime after
37

The grid

Ten per row, twenty rows. The filled cells are primes — you can see the multiples of 2 and 5 drop out in columns.

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 32 a prime number?

No. It breaks down into 2⁵.

Q. What are the divisors of 32?

1, 2, 4, 8, 16, 32 — 6 divisors in all, adding up to 63.

Q. How is 32 written in binary?

100000, which is 6 bits. In hexadecimal it is 20.

Q. How many Collatz steps does 32 take?

It reaches 1 in 5, peaking at 32 on the way.