Search a number
-
+
20102011111011 = 359341333275911
BaseRepresentation
bin1001001001000010111010…
…01110110100011001100011
32122011201210201100212120110
410210201131032310121203
510113322404321023021
6110430423022142403
74143215401116534
oct444413516643143
978151721325513
1020102011111011
116450240239655
122307aa2a21a03
13b2a7c465ac9b
144d6d2a42a68b
1524cd7592a476
hex12485d3b4663

20102011111011 has 16 divisors (see below), whose sum is σ = 27264951256320. Its totient is φ = 13170338970720.

The previous prime is 20102011110997. The next prime is 20102011111031. The reversal of 20102011111011 is 11011111020102.

It is not a de Polignac number, because 20102011111011 - 210 = 20102011109987 is a prime.

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

It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 16033855 + ... + 17242056.

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

Almost surely, 220102011111011 is an apocalyptic number.

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

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

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

The sum of its prime factors is 33279386.

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

Adding to 20102011111011 its reverse (11011111020102), we get a palindrome (31113122131113).

Subtracting from 20102011111011 its reverse (11011111020102), we obtain a palindrome (9090900090909).

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

Divisors: 1 3 59 177 3413 10239 201367 604101 33275911 99827733 1963278749 5889836247 113570684243 340712052729 6700670370337 20102011111011