Numbers·153
153
CLIII
10011001

The number 153 — factors and divisors

Deficient

153 = 3² × 17. It has 6 divisors, adding up to 234.

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

Families it belongs to

Triangular

The running total of 1, 2, 3 … — the dots stack into a triangle.

Laid out as dots

It fits as 9 × 17. The more divisors, the closer to a square.

Prime factors
3² × 17
Divisors
1, 3, 9, 17, 51, 153
Sum of divisors
234
Sum without itself
81
Coprime below it
96
Digit sum
9
Digital root
9
Roman numeral
CLIII
Binary
10011001
Octal
231
Hexadecimal
99
Base 36
49
Bits
8 bits
Collatz steps
36 steps · peaks at 520
Prime before
151
Prime after
157

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

No. It breaks down into 3² × 17.

Q. What are the divisors of 153?

1, 3, 9, 17, 51, 153 — 6 divisors in all, adding up to 234.

Q. How is 153 written in binary?

10011001, which is 8 bits. In hexadecimal it is 99.

Q. How many Collatz steps does 153 take?

It reaches 1 in 36, peaking at 520 on the way.