Search a number
-
+
200011111020110 = 25131538547007847
BaseRepresentation
bin101101011110100010110111…
…001110010011011001001110
3222020011212122012222100202202
4231132202313032103121032
5202203440223410120420
61545215500321121502
760062216533401245
oct5536426716233116
9866155565870682
10200011111020110
115880326598a1a5
121a5235b0489292
13877ac751b7cb0
14375683755395c
15181cb3475d575
hexb5e8b739364e

200011111020110 has 16 divisors (see below), whose sum is σ = 387713845977696. Its totient is φ = 73850256376608.

The previous prime is 200011111020053. The next prime is 200011111020113. The reversal of 200011111020110 is 11020111110002.

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

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (200011111020113) by changing a digit.

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 769273503794 + ... + 769273504053.

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

Almost surely, 2200011111020110 is an apocalyptic number.

200011111020110 is a deficient number, since it is larger than the sum of its proper divisors (187702734957586).

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

200011111020110 is an odious number, because the sum of its binary digits is odd.

The sum of its prime factors is 1538547007867.

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

Adding to 200011111020110 its reverse (11020111110002), we get a palindrome (211031222130112).

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

Divisors: 1 2 5 10 13 26 65 130 1538547007847 3077094015694 7692735039235 15385470078470 20001111102011 40002222204022 100005555510055 200011111020110