Search a number
-
+
200011210110 = 2325231813591487
BaseRepresentation
bin1011101001000110011…
…0001101110101111110
3201010021010101012212200
42322101212031311332
511234110332210420
6231514530212330
720310315143355
oct2722146156576
9633233335780
10200011210110
1177908128558
123291b4240a6
1315b2674578a
14997579c99c
15530943ab90
hex2e9198dd7e

200011210110 has 192 divisors, whose sum is σ = 547524956160. Its totient is φ = 50560139520.

The previous prime is 200011210081. The next prime is 200011210177. The reversal of 200011210110 is 11012110002.

It is a happy number.

It is a Harshad number since it is a multiple of its sum of digits (9).

It is a junction number, because it is equal to n+sod(n) for n = 200011210092 and 200011210101.

It is a congruent number.

It is an unprimeable number.

It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 134505787 + ... + 134507273.

It is an arithmetic number, because the mean of its divisors is an integer number (2851692480).

Almost surely, 2200011210110 is an apocalyptic number.

It is a practical number, because each smaller number is the sum of distinct divisors of 200011210110, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (273762478080).

200011210110 is an abundant number, since it is smaller than the sum of its proper divisors (347513746050).

It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.

200011210110 is a wasteful number, since it uses less digits than its factorization.

200011210110 is an evil number, because the sum of its binary digits is even.

The sum of its prime factors is 2063 (or 2060 counting only the distinct ones).

The product of its (nonzero) digits is 4, while the sum is 9.

Adding to 200011210110 its reverse (11012110002), we get a palindrome (211023320112).

The spelling of 200011210110 in words is "two hundred billion, eleven million, two hundred ten thousand, one hundred ten".