Base | Representation |
---|---|
bin | 10100110000000100… |
… | …01110100110001111 |
3 | 1001202102002221022111 |
4 | 22120002032212033 |
5 | 140304001434003 |
6 | 5041250524451 |
7 | 543035003125 |
oct | 123002164617 |
9 | 31672087274 |
10 | 11140655503 |
11 | 47a767840a |
12 | 21aab96727 |
13 | 1087104163 |
14 | 779845915 |
15 | 4530c4e6d |
hex | 29808e98f |
11140655503 has 2 divisors, whose sum is σ = 11140655504. Its totient is φ = 11140655502.
The previous prime is 11140655497. The next prime is 11140655531. The reversal of 11140655503 is 30555604111.
It is a happy number.
It is a weak prime.
It is an emirp because it is prime and its reverse (30555604111) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11140655503 is a prime.
It is a super-2 number, since 2×111406555032 (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 (11140655593) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5570327751 + 5570327752.
It is an arithmetic number, because the mean of its divisors is an integer number (5570327752).
Almost surely, 211140655503 is an apocalyptic number.
11140655503 is a deficient number, since it is larger than the sum of its proper divisors (1).
11140655503 is an equidigital number, since it uses as much as digits as its factorization.
11140655503 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 9000, while the sum is 31.
The spelling of 11140655503 in words is "eleven billion, one hundred forty million, six hundred fifty-five thousand, five hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •