Base | Representation |
---|---|
bin | 1010000000010110101010… |
… | …1000011001101011011101 |
3 | 1102221201000120002012212002 |
4 | 2200011222220121223131 |
5 | 2420220424224032033 |
6 | 35221514232252045 |
7 | 2213544665661521 |
oct | 240055250315335 |
9 | 42851016065762 |
10 | 11001200220893 |
11 | 35616457a6703 |
12 | 1298133841025 |
13 | 61a540c94c2c |
14 | 2a0664b21d81 |
15 | 141276c3a3e8 |
hex | a016aa19add |
11001200220893 has 2 divisors, whose sum is σ = 11001200220894. Its totient is φ = 11001200220892.
The previous prime is 11001200220839. The next prime is 11001200220931. The reversal of 11001200220893 is 39802200210011.
Together with previous prime (11001200220839) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 8457551626969 + 2543648593924 = 2908187^2 + 1594882^2 .
It is an emirp because it is prime and its reverse (39802200210011) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 11001200220893 - 220 = 11001199172317 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11001200210893) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5500600110446 + 5500600110447.
It is an arithmetic number, because the mean of its divisors is an integer number (5500600110447).
Almost surely, 211001200220893 is an apocalyptic number.
It is an amenable number.
11001200220893 is a deficient number, since it is larger than the sum of its proper divisors (1).
11001200220893 is an equidigital number, since it uses as much as digits as its factorization.
11001200220893 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1728, while the sum is 29.
The spelling of 11001200220893 in words is "eleven trillion, one billion, two hundred million, two hundred twenty thousand, eight hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •