Numbers·230
230
CCXXX
11100110

The number 230 — factors and divisors

Deficient

230 = 2 × 5 × 23. It has 8 divisors, adding up to 432.

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

Laid out as dots

It fits as 10 × 23. The more divisors, the closer to a square.

Prime factors
2 × 5 × 23
Divisors
1, 2, 5, 10, 23, 46, 115, 230
Sum of divisors
432
Sum without itself
202
Coprime below it
88
Digit sum
5
Digital root
5
Roman numeral
CCXXX
Binary
11100110
Octal
346
Hexadecimal
E6
Base 36
6E
Bits
8 bits
Collatz steps
34 steps · peaks at 520
Prime before
229
Prime after
233

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

No. It breaks down into 2 × 5 × 23.

Q. What are the divisors of 230?

1, 2, 5, 10, 23, 46, 115, 230 — 8 divisors in all, adding up to 432.

Q. How is 230 written in binary?

11100110, which is 8 bits. In hexadecimal it is E6.

Q. How many Collatz steps does 230 take?

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