Search a number
-
+
20003201110101 = 3111645136846247
BaseRepresentation
bin1001000110001010110111…
…01100100101000001010101
32121211021202110220202012010
410203011123230211001111
510110213023441010401
6110313202125014433
74133116654014246
oct443053354450125
977737673822163
1020003201110101
1164123455a9480
1222b09076b4419
13b213a8550921
144d2235454ccd
1524a4e0e02ed6
hex12315bb25055

20003201110101 has 16 divisors (see below), whose sum is σ = 29097334660608. Its totient is φ = 12122414934000.

The previous prime is 20003201110091. The next prime is 20003201110121. The reversal of 20003201110101 is 10101110230002.

It is not a de Polignac number, because 20003201110101 - 215 = 20003201077333 is a prime.

It is a super-2 number, since 2×200032011101012 (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 (20003201110121) 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, 17880241 + ... + 18966006.

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

Almost surely, 220003201110101 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 36862712.

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

Adding to 20003201110101 its reverse (10101110230002), we get a palindrome (30104311340103).

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

Divisors: 1 3 11 33 16451 49353 180961 542883 36846247 110538741 405308717 1215926151 606157609397 1818472828191 6667733703367 20003201110101