Base | Representation |
---|---|
bin | 10110111110000011001001… |
… | …011010101100111011011111 |
3 | 111020200111212212210122212211 |
4 | 112332003021122230323133 |
5 | 101220112012031201421 |
6 | 554504224502541251 |
7 | 30164345542140124 |
oct | 2676031132547337 |
9 | 436614785718784 |
10 | 101021010022111 |
11 | 2a2088515aa703 |
12 | b3b666ba37827 |
13 | 444a31812521a |
14 | 1ad362b73a74b |
15 | ba2bc57b29e1 |
hex | 5be0c96acedf |
101021010022111 has 2 divisors, whose sum is σ = 101021010022112. Its totient is φ = 101021010022110.
The previous prime is 101021010022043. The next prime is 101021010022123. The reversal of 101021010022111 is 111220010120101.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-101021010022111 is a prime.
It is a super-2 number, since 2×1010210100221112 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 101021010022091 and 101021010022100.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (101021010022711) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50510505011055 + 50510505011056.
It is an arithmetic number, because the mean of its divisors is an integer number (50510505011056).
Almost surely, 2101021010022111 is an apocalyptic number.
101021010022111 is a deficient number, since it is larger than the sum of its proper divisors (1).
101021010022111 is an equidigital number, since it uses as much as digits as its factorization.
101021010022111 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 101021010022111 its reverse (111220010120101), we get a palindrome (212241020142212).
The spelling of 101021010022111 in words is "one hundred one trillion, twenty-one billion, ten million, twenty-two thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •