Search a number
-
+
20010101112110 = 252001010111211
BaseRepresentation
bin1001000110010111101101…
…11101111111110100101110
32121211221120100111011112002
410203023312331333310232
510110321141341041420
6110320302532012302
74133452650040214
oct443136675776456
977757510434462
1020010101112110
11641526646307a
1222b2112461092
13b21c37c13c55
144d26cb9c0cb4
1524a796a68075
hex1232f6f7fd2e

20010101112110 has 8 divisors (see below), whose sum is σ = 36018182001816. Its totient is φ = 8004040444840.

The previous prime is 20010101112109. The next prime is 20010101112137. The reversal of 20010101112110 is 1121110101002.

It is a sphenic number, since it is the product of 3 distinct primes.

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

It is a congruent number.

It is an unprimeable number.

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

It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1000505055596 + ... + 1000505055615.

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

Almost surely, 220010101112110 is an apocalyptic number.

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

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

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

The sum of its prime factors is 2001010111218.

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

Adding to 20010101112110 its reverse (1121110101002), we get a palindrome (21131211213112).

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

Divisors: 1 2 5 10 2001010111211 4002020222422 10005050556055 20010101112110