Search a number
-
+
20101010220110 = 2515712803191223
BaseRepresentation
bin1001001001000001000011…
…00100101110010001001110
32122011122012222000100101002
410210200201210232101032
510113313332104020420
6110430135425420302
74143151525515341
oct444404144562116
978148188010332
1020101010220110
11644a877267496
12230786379a692
13b2a69519b451
144d6c7352a458
1524cd17b20075
hex12482192e44e

20101010220110 has 16 divisors (see below), whose sum is σ = 36412275841056. Its totient is φ = 7989191322528.

The previous prime is 20101010220103. The next prime is 20101010220199. The reversal of 20101010220110 is 1102201010102.

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

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

It is a congruent number.

It is an unprimeable number.

It is a pernicious number, because its binary representation contains a prime number (17) of ones.

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

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

Almost surely, 220101010220110 is an apocalyptic number.

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

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

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

The sum of its prime factors is 12803191387.

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

Adding to 20101010220110 its reverse (1102201010102), we get a palindrome (21203211230212).

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

Divisors: 1 2 5 10 157 314 785 1570 12803191223 25606382446 64015956115 128031912230 2010101022011 4020202044022 10050505110055 20101010220110