Numbers·156
156
CLVI
10011100

The number 156 — factors and divisors

Abundant

156 = 2² × 3 × 13. It has 12 divisors, adding up to 392.

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

Laid out as dots

It fits as 12 × 13. The more divisors, the closer to a square.

Prime factors
2² × 3 × 13
Divisors
1, 2, 3, 4, 6, 12, 13, 26, 39, 52, 78, 156
Sum of divisors
392
Sum without itself
236
Coprime below it
48
Digit sum
12
Digital root
3
Roman numeral
CLVI
Binary
10011100
Octal
234
Hexadecimal
9C
Base 36
4C
Bits
8 bits
Collatz steps
36 steps · peaks at 304
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 156 a prime number?

No. It breaks down into 2² × 3 × 13.

Q. What are the divisors of 156?

1, 2, 3, 4, 6, 12, 13, 26, 39, 52, 78, 156 — 12 divisors in all, adding up to 392.

Q. How is 156 written in binary?

10011100, which is 8 bits. In hexadecimal it is 9C.

Q. How many Collatz steps does 156 take?

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