Base | Representation |
---|---|
bin | 10100100000100111… |
… | …01000101100110111 |
3 | 1001102101010210222011 |
4 | 22100103220230313 |
5 | 140022304014033 |
6 | 5020335545051 |
7 | 536601652102 |
oct | 122023505467 |
9 | 31371123864 |
10 | 11011001143 |
11 | 474047214a |
12 | 217368b187 |
13 | 10662a9abc |
14 | 766535739 |
15 | 446a13ccd |
hex | 2904e8b37 |
11011001143 has 2 divisors, whose sum is σ = 11011001144. Its totient is φ = 11011001142.
The previous prime is 11011001077. The next prime is 11011001159. The reversal of 11011001143 is 34110011011.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11011001143 is a prime.
It is a super-2 number, since 2×110110011432 (a number of 21 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11011002143) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5505500571 + 5505500572.
It is an arithmetic number, because the mean of its divisors is an integer number (5505500572).
Almost surely, 211011001143 is an apocalyptic number.
11011001143 is a deficient number, since it is larger than the sum of its proper divisors (1).
11011001143 is an equidigital number, since it uses as much as digits as its factorization.
11011001143 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 12, while the sum is 13.
Adding to 11011001143 its reverse (34110011011), we get a palindrome (45121012154).
The spelling of 11011001143 in words is "eleven billion, eleven million, one thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •