Search a number
-
+
200011012110 = 232572133794291
BaseRepresentation
bin1011101001000110010…
…1011101100000001110
3201010021010000011021100
42322101211131200032
511234110304341420
6231514522043530
720310313360200
oct2722145354016
9633233004240
10200011012110
1177908002818
123291b3495a6
1315b266a6610
14997574a770
1553093ec190
hex2e9195d80e

200011012110 has 288 divisors, whose sum is σ = 669078682272. Its totient is φ = 41059146240.

The previous prime is 200011012099. The next prime is 200011012153. The reversal of 200011012110 is 11210110002.

It is a happy number.

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

It is a Curzon number.

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

It is a congruent number.

It is an unprimeable number.

It is a polite number, since it can be written in 143 ways as a sum of consecutive naturals, for example, 2074065 + ... + 2168355.

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

Almost surely, 2200011012110 is an apocalyptic number.

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

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

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

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

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

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

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

Adding to 200011012110 its reverse (11210110002), we get a palindrome (211221122112).

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