Search a number
-
+
20010102010113 = 347211672585863
BaseRepresentation
bin1001000110010111101110…
…00001011011000100000001
32121211221120102011210100110
410203023313001123010001
510110321142103310423
6110320303003141533
74133452660500255
oct443136701330401
977757512153313
1020010102010113
116415266a16826
1222b21128148a9
13b21c38169907
144d26cbb76265
1524a796b94193
hex1232f705b101

20010102010113 has 16 divisors (see below), whose sum is σ = 27376935008256. Its totient is φ = 12994358853840.

The previous prime is 20010102010061. The next prime is 20010102010277. The reversal of 20010102010113 is 31101020101002.

It is not a de Polignac number, because 20010102010113 - 214 = 20010101993729 is a prime.

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

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

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

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

Almost surely, 220010102010113 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 672586124.

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

Adding to 20010102010113 its reverse (31101020101002), we get a palindrome (51111122111115).

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

Divisors: 1 3 47 141 211 633 9917 29751 672585863 2017757589 31611535561 94834606683 141915617093 425746851279 6670034003371 20010102010113