Numbers·136
136
CXXXVI
10001000

The number 136 — factors and divisors

Deficient

136 = 2³ × 17. It has 8 divisors, adding up to 270.

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 8 × 17. The more divisors, the closer to a square.

Prime factors
2³ × 17
Divisors
1, 2, 4, 8, 17, 34, 68, 136
Sum of divisors
270
Sum without itself
134
Coprime below it
64
Digit sum
10
Digital root
1
Roman numeral
CXXXVI
Binary
10001000
Octal
210
Hexadecimal
88
Base 36
3S
Bits
8 bits
Collatz steps
15 steps · peaks at 136
Prime before
131
Prime after
137

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

No. It breaks down into 2³ × 17.

Q. What are the divisors of 136?

1, 2, 4, 8, 17, 34, 68, 136 — 8 divisors in all, adding up to 270.

Q. How is 136 written in binary?

10001000, which is 8 bits. In hexadecimal it is 88.

Q. How many Collatz steps does 136 take?

It reaches 1 in 15, peaking at 136 on the way.