Base | Representation |
---|---|
bin | 1010000111011001000011… |
… | …1000101100100101101111 |
3 | 1110101021002100102210110101 |
4 | 2201312100320230211233 |
5 | 2424211030341024101 |
6 | 35353231150051531 |
7 | 2225355014411242 |
oct | 241662070544557 |
9 | 43337070383411 |
10 | 11122101111151 |
11 | 35a8947140a28 |
12 | 12b76551a9ba7 |
13 | 628a6a9c7c54 |
14 | 2a6453977259 |
15 | 1444a0d46401 |
hex | a1d90e2c96f |
11122101111151 has 2 divisors, whose sum is σ = 11122101111152. Its totient is φ = 11122101111150.
The previous prime is 11122101111137. The next prime is 11122101111203. The reversal of 11122101111151 is 15111110122111.
11122101111151 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 11122101111151 - 211 = 11122101109103 is a prime.
It is a super-2 number, since 2×111221011111512 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11122101111551) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5561050555575 + 5561050555576.
It is an arithmetic number, because the mean of its divisors is an integer number (5561050555576).
Almost surely, 211122101111151 is an apocalyptic number.
11122101111151 is a deficient number, since it is larger than the sum of its proper divisors (1).
11122101111151 is an equidigital number, since it uses as much as digits as its factorization.
11122101111151 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 20, while the sum is 19.
Adding to 11122101111151 its reverse (15111110122111), we get a palindrome (26233211233262).
The spelling of 11122101111151 in words is "eleven trillion, one hundred twenty-two billion, one hundred one million, one hundred eleven thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •