Base | Representation |
---|---|
bin | 1010000111011001000011… |
… | …1000101111010000101001 |
3 | 1110101021002100110100110111 |
4 | 2201312100320233100221 |
5 | 2424211030341401324 |
6 | 35353231150214321 |
7 | 2225355014455156 |
oct | 241662070572051 |
9 | 43337070410414 |
10 | 11122101122089 |
11 | 35a8947149171 |
12 | 12b76551b43a1 |
13 | 628a6a9ccc19 |
14 | 2a645397b22d |
15 | 1444a0d49794 |
hex | a1d90e2f429 |
11122101122089 has 2 divisors, whose sum is σ = 11122101122090. Its totient is φ = 11122101122088.
The previous prime is 11122101122059. The next prime is 11122101122107. The reversal of 11122101122089 is 98022110122111.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 7340398606489 + 3781702515600 = 2709317^2 + 1944660^2 .
It is a cyclic number.
It is not a de Polignac number, because 11122101122089 - 29 = 11122101121577 is a prime.
It is a super-2 number, since 2×111221011220892 (a number of 27 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 11122101122089.
It is not a weakly prime, because it can be changed into another prime (11122101122009) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5561050561044 + 5561050561045.
It is an arithmetic number, because the mean of its divisors is an integer number (5561050561045).
Almost surely, 211122101122089 is an apocalyptic number.
It is an amenable number.
11122101122089 is a deficient number, since it is larger than the sum of its proper divisors (1).
11122101122089 is an equidigital number, since it uses as much as digits as its factorization.
11122101122089 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1152, while the sum is 31.
The spelling of 11122101122089 in words is "eleven trillion, one hundred twenty-two billion, one hundred one million, one hundred twenty-two thousand, eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •