Base | Representation |
---|---|
bin | 1010000000010010100100… |
… | …0111001111111011110111 |
3 | 1102221121011221201120121122 |
4 | 2200010221013033323313 |
5 | 2420211201324324231 |
6 | 35221213204334155 |
7 | 2213505520566515 |
oct | 240045107177367 |
9 | 42847157646548 |
10 | 11000101011191 |
11 | 3561131281136 |
12 | 1297a876a435b |
13 | 61a3c732cba6 |
14 | 2a059cb4b4b5 |
15 | 1412104ad77b |
hex | a01291cfef7 |
11000101011191 has 2 divisors, whose sum is σ = 11000101011192. Its totient is φ = 11000101011190.
The previous prime is 11000101011187. The next prime is 11000101011271. The reversal of 11000101011191 is 19111010100011.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 11000101011191 - 22 = 11000101011187 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11000101011091) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5500050505595 + 5500050505596.
It is an arithmetic number, because the mean of its divisors is an integer number (5500050505596).
Almost surely, 211000101011191 is an apocalyptic number.
11000101011191 is a deficient number, since it is larger than the sum of its proper divisors (1).
11000101011191 is an equidigital number, since it uses as much as digits as its factorization.
11000101011191 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 9, while the sum is 17.
The spelling of 11000101011191 in words is "eleven trillion, one hundred one million, eleven thousand, one hundred ninety-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •