Numbers·206
206
CCVI
11001110

The number 206 — factors and divisors

Deficient

206 = 2 × 103. It has 4 divisors, adding up to 312.

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

Laid out as dots

It fits as 2 × 103. The more divisors, the closer to a square.

Prime factors
2 × 103
Divisors
1, 2, 103, 206
Sum of divisors
312
Sum without itself
106
Coprime below it
102
Digit sum
8
Digital root
8
Roman numeral
CCVI
Binary
11001110
Octal
316
Hexadecimal
CE
Base 36
5Q
Bits
8 bits
Collatz steps
88 steps · peaks at 9,232
Prime before
199
Prime after
211

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

No. It breaks down into 2 × 103.

Q. What are the divisors of 206?

1, 2, 103, 206 — 4 divisors in all, adding up to 312.

Q. How is 206 written in binary?

11001110, which is 8 bits. In hexadecimal it is CE.

Q. How many Collatz steps does 206 take?

It reaches 1 in 88, peaking at 9,232 on the way.