Base | Representation |
---|---|
bin | 1010000110110100001101… |
… | …1001101011110001100111 |
3 | 1110100022120002211022101112 |
4 | 2201231003121223301213 |
5 | 2424030302031414002 |
6 | 35344513535015235 |
7 | 2224554644514311 |
oct | 241550331536147 |
9 | 43308502738345 |
10 | 11112211201127 |
11 | 35a473158a173 |
12 | 12b575506a51b |
13 | 627b52a74a9a |
14 | 2a5b962b07b1 |
15 | 1440c2982852 |
hex | a1b4366bc67 |
11112211201127 has 2 divisors, whose sum is σ = 11112211201128. Its totient is φ = 11112211201126.
The previous prime is 11112211201061. The next prime is 11112211201187. The reversal of 11112211201127 is 72110211221111.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11112211201127 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11112211201187) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5556105600563 + 5556105600564.
It is an arithmetic number, because the mean of its divisors is an integer number (5556105600564).
Almost surely, 211112211201127 is an apocalyptic number.
11112211201127 is a deficient number, since it is larger than the sum of its proper divisors (1).
11112211201127 is an equidigital number, since it uses as much as digits as its factorization.
11112211201127 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 112, while the sum is 23.
Adding to 11112211201127 its reverse (72110211221111), we get a palindrome (83222422422238).
The spelling of 11112211201127 in words is "eleven trillion, one hundred twelve billion, two hundred eleven million, two hundred one thousand, one hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.376 sec. • engine limits •