Base | Representation |
---|---|
bin | 11101101111111111110… |
… | …11110001111001011111 |
3 | 10121201110221201200011111 |
4 | 32313333323301321133 |
5 | 113221431441010421 |
6 | 2101332005202451 |
7 | 133565045034406 |
oct | 16677773617137 |
9 | 3551427650144 |
10 | 1022201110111 |
11 | 364570972585 |
12 | 146139100427 |
13 | 755159a319c |
14 | 37690bb863d |
15 | 1b8ca86cee1 |
hex | edffef1e5f |
1022201110111 has 2 divisors, whose sum is σ = 1022201110112. Its totient is φ = 1022201110110.
The previous prime is 1022201110103. The next prime is 1022201110123. The reversal of 1022201110111 is 1110111022201.
It is a happy number.
It is a weak prime.
It is an emirp because it is prime and its reverse (1110111022201) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1022201110111 - 23 = 1022201110103 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1022201110091 and 1022201110100.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1022201110181) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 511100555055 + 511100555056.
It is an arithmetic number, because the mean of its divisors is an integer number (511100555056).
Almost surely, 21022201110111 is an apocalyptic number.
1022201110111 is a deficient number, since it is larger than the sum of its proper divisors (1).
1022201110111 is an equidigital number, since it uses as much as digits as its factorization.
1022201110111 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 1022201110111 its reverse (1110111022201), we get a palindrome (2132312132312).
The spelling of 1022201110111 in words is "one trillion, twenty-two billion, two hundred one million, one hundred ten thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •