Numbers·236
236
CCXXXVI
11101100

The number 236 — factors and divisors

Deficient

236 = 2² × 59. It has 6 divisors, adding up to 420.

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

Laid out as dots

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

Prime factors
2² × 59
Divisors
1, 2, 4, 59, 118, 236
Sum of divisors
420
Sum without itself
184
Coprime below it
116
Digit sum
11
Digital root
2
Roman numeral
CCXXXVI
Binary
11101100
Octal
354
Hexadecimal
EC
Base 36
6K
Bits
8 bits
Collatz steps
34 steps · peaks at 304
Prime before
233
Prime after
239

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

No. It breaks down into 2² × 59.

Q. What are the divisors of 236?

1, 2, 4, 59, 118, 236 — 6 divisors in all, adding up to 420.

Q. How is 236 written in binary?

11101100, which is 8 bits. In hexadecimal it is EC.

Q. How many Collatz steps does 236 take?

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