Numbers·202
202
CCII
11001010

The number 202 — factors and divisors

Deficient

202 = 2 × 101. It has 4 divisors, adding up to 306.

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

Laid out as dots

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

Prime factors
2 × 101
Divisors
1, 2, 101, 202
Sum of divisors
306
Sum without itself
104
Coprime below it
100
Digit sum
4
Digital root
4
Roman numeral
CCII
Binary
11001010
Octal
312
Hexadecimal
CA
Base 36
5M
Bits
8 bits
Collatz steps
26 steps · peaks at 304
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 202 a prime number?

No. It breaks down into 2 × 101.

Q. What are the divisors of 202?

1, 2, 101, 202 — 4 divisors in all, adding up to 306.

Q. How is 202 written in binary?

11001010, which is 8 bits. In hexadecimal it is CA.

Q. How many Collatz steps does 202 take?

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