Base | Representation |
---|---|
bin | 1010000001100000110011… |
… | …0100100111011011010111 |
3 | 1110000121101111021202111111 |
4 | 2200120030310213123113 |
5 | 2421032203401413421 |
6 | 35235005103315451 |
7 | 2215151106345151 |
oct | 240301464473327 |
9 | 43017344252444 |
10 | 11021101201111 |
11 | 356a0283436a1 |
12 | 129bb685abb87 |
13 | 61c392cb0281 |
14 | 2a15d1bcdad1 |
15 | 141a3de46ee1 |
hex | a060cd276d7 |
11021101201111 has 2 divisors, whose sum is σ = 11021101201112. Its totient is φ = 11021101201110.
The previous prime is 11021101201109. The next prime is 11021101201127. The reversal of 11021101201111 is 11110210112011.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 11021101201111 - 21 = 11021101201109 is a prime.
Together with 11021101201109, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 11021101201091 and 11021101201100.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11021101201141) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5510550600555 + 5510550600556.
It is an arithmetic number, because the mean of its divisors is an integer number (5510550600556).
Almost surely, 211021101201111 is an apocalyptic number.
11021101201111 is a deficient number, since it is larger than the sum of its proper divisors (1).
11021101201111 is an equidigital number, since it uses as much as digits as its factorization.
11021101201111 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 11021101201111 its reverse (11110210112011), we get a palindrome (22131311313122).
The spelling of 11021101201111 in words is "eleven trillion, twenty-one billion, one hundred one million, two hundred one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •