Base | Representation |
---|---|
bin | 1010001000101010101110… |
… | …1101111011110001010111 |
3 | 1110110100200100012012011011 |
4 | 2202022223231323301113 |
5 | 2430040431141023223 |
6 | 35411254522553051 |
7 | 2230062233006626 |
oct | 242125355736127 |
9 | 43410610165134 |
10 | 11144026111063 |
11 | 360717824096a |
12 | 12bb953968787 |
13 | 62ab5314a591 |
14 | 2a75337936bd |
15 | 144d35aac80d |
hex | a22abb7bc57 |
11144026111063 has 2 divisors, whose sum is σ = 11144026111064. Its totient is φ = 11144026111062.
The previous prime is 11144026111027. The next prime is 11144026111103. The reversal of 11144026111063 is 36011162044111.
It is a weak prime.
It is an emirp because it is prime and its reverse (36011162044111) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11144026111063 is a prime.
It is a super-2 number, since 2×111440261110632 (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 (11144026111003) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5572013055531 + 5572013055532.
It is an arithmetic number, because the mean of its divisors is an integer number (5572013055532).
Almost surely, 211144026111063 is an apocalyptic number.
11144026111063 is a deficient number, since it is larger than the sum of its proper divisors (1).
11144026111063 is an equidigital number, since it uses as much as digits as its factorization.
11144026111063 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3456, while the sum is 31.
Adding to 11144026111063 its reverse (36011162044111), we get a palindrome (47155188155174).
The spelling of 11144026111063 in words is "eleven trillion, one hundred forty-four billion, twenty-six million, one hundred eleven thousand, sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •