Base | Representation |
---|---|
bin | 101111001000010101… |
… | …0001000010101100111 |
3 | 100200020120202020112111 |
4 | 1132100222020111213 |
5 | 3124240032223421 |
6 | 114255031301451 |
7 | 10212052046143 |
oct | 1362052102547 |
9 | 320216666474 |
10 | 101211211111 |
11 | 39a180a9a1a |
12 | 1774751a887 |
13 | 970c72aaca |
14 | 4c81c6c223 |
15 | 297573bee1 |
hex | 1790a88567 |
101211211111 has 2 divisors, whose sum is σ = 101211211112. Its totient is φ = 101211211110.
The previous prime is 101211211063. The next prime is 101211211117. The reversal of 101211211111 is 111112112101.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 101211211111 - 27 = 101211210983 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 101211211091 and 101211211100.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (101211211117) by changing a digit.
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 as a sum of consecutive naturals, namely, 50605605555 + 50605605556.
It is an arithmetic number, because the mean of its divisors is an integer number (50605605556).
Almost surely, 2101211211111 is an apocalyptic number.
101211211111 is a deficient number, since it is larger than the sum of its proper divisors (1).
101211211111 is an equidigital number, since it uses as much as digits as its factorization.
101211211111 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 101211211111 its reverse (111112112101), we get a palindrome (212323323212).
The spelling of 101211211111 in words is "one hundred one billion, two hundred eleven million, two hundred eleven thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •