Base | Representation |
---|---|
bin | 1010000110110000100001… |
… | …1001001000110010101001 |
3 | 1110100020000002222011000111 |
4 | 2201230020121020302221 |
5 | 2424021240111431324 |
6 | 35344231411534321 |
7 | 2224521263615611 |
oct | 241541031106251 |
9 | 43306002864014 |
10 | 11111221202089 |
11 | 35a4273777248 |
12 | 12b55195ba3a1 |
13 | 627a25929a38 |
14 | 2a5b00a07a41 |
15 | 144065ac9794 |
hex | a1b08648ca9 |
11111221202089 has 2 divisors, whose sum is σ = 11111221202090. Its totient is φ = 11111221202088.
The previous prime is 11111221202063. The next prime is 11111221202153. The reversal of 11111221202089 is 98020212211111.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 6497059438489 + 4614161763600 = 2548933^2 + 2148060^2 .
It is a cyclic number.
It is not a de Polignac number, because 11111221202089 - 225 = 11111187647657 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 11111221202089.
It is not a weakly prime, because it can be changed into another prime (11111221202489) 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, 5555610601044 + 5555610601045.
It is an arithmetic number, because the mean of its divisors is an integer number (5555610601045).
Almost surely, 211111221202089 is an apocalyptic number.
It is an amenable number.
11111221202089 is a deficient number, since it is larger than the sum of its proper divisors (1).
11111221202089 is an equidigital number, since it uses as much as digits as its factorization.
11111221202089 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1152, while the sum is 31.
The spelling of 11111221202089 in words is "eleven trillion, one hundred eleven billion, two hundred twenty-one million, two hundred two thousand, eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •