Base | Representation |
---|---|
bin | 1001100110011000101001… |
… | …01011000110010000111011 |
3 | 2202202002212221100110211011 |
4 | 10303030110223012100323 |
5 | 10231332001420231021 |
6 | 112521503503414351 |
7 | 4306104142502641 |
oct | 463142453062073 |
9 | 82662787313734 |
10 | 21110111102011 |
11 | 67a9825417688 |
12 | 244b3455b43b7 |
13 | ba18a0aa92b9 |
14 | 52da40529191 |
15 | 2691c833dde1 |
hex | 133314ac643b |
21110111102011 has 2 divisors, whose sum is σ = 21110111102012. Its totient is φ = 21110111102010.
The previous prime is 21110111101991. The next prime is 21110111102027. The reversal of 21110111102011 is 11020111101112.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 21110111102011 - 27 = 21110111101883 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 21110111101982 and 21110111102000.
It is not a weakly prime, because it can be changed into another prime (21110111102911) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10555055551005 + 10555055551006.
It is an arithmetic number, because the mean of its divisors is an integer number (10555055551006).
Almost surely, 221110111102011 is an apocalyptic number.
21110111102011 is a deficient number, since it is larger than the sum of its proper divisors (1).
21110111102011 is an equidigital number, since it uses as much as digits as its factorization.
21110111102011 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4, while the sum is 13.
Adding to 21110111102011 its reverse (11020111101112), we get a palindrome (32130222203123).
The spelling of 21110111102011 in words is "twenty-one trillion, one hundred ten billion, one hundred eleven million, one hundred two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •