Base | Representation |
---|---|
bin | 11001001111011010001110… |
… | …001110111110010001111001 |
3 | 112120001110111111122100112212 |
4 | 121033122032032332101321 |
5 | 104022242201410202301 |
6 | 1032033201352344505 |
7 | 32245134015530456 |
oct | 3117321616762171 |
9 | 476043444570485 |
10 | 111010111022201 |
11 | 3240a13a70a786 |
12 | 1054a6056a5135 |
13 | 49c3293259b71 |
14 | 1d5acbd16a82d |
15 | cc79639674bb |
hex | 64f68e3be479 |
111010111022201 has 2 divisors, whose sum is σ = 111010111022202. Its totient is φ = 111010111022200.
The previous prime is 111010111022143. The next prime is 111010111022233. The reversal of 111010111022201 is 102220111010111.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 99341567416576 + 11668543605625 = 9967024^2 + 3415925^2 .
It is a cyclic number.
It is not a de Polignac number, because 111010111022201 - 26 = 111010111022137 is a prime.
It is a super-2 number, since 2×1110101110222012 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (111010111022501) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55505055511100 + 55505055511101.
It is an arithmetic number, because the mean of its divisors is an integer number (55505055511101).
Almost surely, 2111010111022201 is an apocalyptic number.
It is an amenable number.
111010111022201 is a deficient number, since it is larger than the sum of its proper divisors (1).
111010111022201 is an equidigital number, since it uses as much as digits as its factorization.
111010111022201 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 14.
Adding to 111010111022201 its reverse (102220111010111), we get a palindrome (213230222032312).
The spelling of 111010111022201 in words is "one hundred eleven trillion, ten billion, one hundred eleven million, twenty-two thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •