Base | Representation |
---|---|
bin | 1001001001010011110111… |
… | …00100011001110001110011 |
3 | 2122012121021211120100111111 |
4 | 10210221323210121301303 |
5 | 10114000023131121321 |
6 | 110434525535254151 |
7 | 4143660024430600 |
oct | 444517344316163 |
9 | 78177254510444 |
10 | 20111110020211 |
11 | 645408a346821 |
12 | 230980207a357 |
13 | b2b61475c422 |
14 | 4d7550a2b6a7 |
15 | 24d2096435e1 |
hex | 124a7b919c73 |
20111110020211 has 24 divisors (see below), whose sum is σ = 23802341073840. Its totient is φ = 16937898227712.
The previous prime is 20111110020121. The next prime is 20111110020241. The reversal of 20111110020211 is 11202001111102.
It is a happy number.
It is a de Polignac number, because none of the positive numbers 2k-20111110020211 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 20111110020191 and 20111110020200.
It is not an unprimeable number, because it can be changed into a prime (20111110020241) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 4462575 + ... + 7754791.
It is an arithmetic number, because the mean of its divisors is an integer number (991764211410).
Almost surely, 220111110020211 is an apocalyptic number.
20111110020211 is a deficient number, since it is larger than the sum of its proper divisors (3691231053629).
20111110020211 is a wasteful number, since it uses less digits than its factorization.
20111110020211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3294403 (or 3294396 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 20111110020211 its reverse (11202001111102), we get a palindrome (31313111131313).
The spelling of 20111110020211 in words is "twenty trillion, one hundred eleven billion, one hundred ten million, twenty thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •