Base | Representation |
---|---|
bin | 1010000000010010111100… |
… | …0001101010101001111111 |
3 | 1102221121102212101110021021 |
4 | 2200010233001222221333 |
5 | 2420211402223223241 |
6 | 35221231110445011 |
7 | 2213511134020141 |
oct | 240045701525177 |
9 | 42847385343237 |
10 | 11000200211071 |
11 | 3561182276505 |
12 | 1297ab4963767 |
13 | 61a411a53446 |
14 | 2a05abdb0c91 |
15 | 1412190560d1 |
hex | a012f06aa7f |
11000200211071 has 2 divisors, whose sum is σ = 11000200211072. Its totient is φ = 11000200211070.
The previous prime is 11000200211009. The next prime is 11000200211107. The reversal of 11000200211071 is 17011200200011.
Together with next prime (11000200211107) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11000200211071 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11000200221071) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5500100105535 + 5500100105536.
It is an arithmetic number, because the mean of its divisors is an integer number (5500100105536).
Almost surely, 211000200211071 is an apocalyptic number.
11000200211071 is a deficient number, since it is larger than the sum of its proper divisors (1).
11000200211071 is an equidigital number, since it uses as much as digits as its factorization.
11000200211071 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 28, while the sum is 16.
Adding to 11000200211071 its reverse (17011200200011), we get a palindrome (28011400411082).
The spelling of 11000200211071 in words is "eleven trillion, two hundred million, two hundred eleven thousand, seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •