Search a number
-
+
20000102031111 = 3149331211430729
BaseRepresentation
bin1001000110000101000101…
…11110100001111100000111
32121210222202111110020000210
410203002202332201330013
510110140202104443421
6110311530421010503
74132650113203446
oct443024276417407
977728674406023
1020000102031111
116410aa5216574
1222b01a1853a33
13b21003488b87
144d201da1ad5d
1524a3adcdc576
hex1230a2fa1f07

20000102031111 has 16 divisors (see below), whose sum is σ = 26693232622560. Its totient is φ = 13320192138240.

The previous prime is 20000102031079. The next prime is 20000102031127. The reversal of 20000102031111 is 11113020100002.

It is not a de Polignac number, because 20000102031111 - 25 = 20000102031079 is a prime.

It is a super-2 number, since 2×200001020311112 (a number of 27 digits) contains 22 as substring.

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (20000102031011) 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, 13263595 + ... + 14694323.

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

Almost surely, 220000102031111 is an apocalyptic number.

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

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

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

The sum of its prime factors is 1435346.

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

Adding to 20000102031111 its reverse (11113020100002), we get a palindrome (31113122131113).

The spelling of 20000102031111 in words is "twenty trillion, one hundred two million, thirty-one thousand, one hundred eleven".

Divisors: 1 3 1493 3121 4479 9363 1430729 4292187 4659653 13978959 2136078397 4465305209 6408235191 13395915627 6666700677037 20000102031111