Base | Representation |
---|---|
bin | 1010000000010010001100… |
… | …0110010101110110100111 |
3 | 1102221120220220212021012011 |
4 | 2200010203012111312213 |
5 | 2420211000012004431 |
6 | 35221155201535051 |
7 | 2213503154132104 |
oct | 240044306256647 |
9 | 42846826767164 |
10 | 11000000109991 |
11 | 356108a324612 |
12 | 1297a59944487 |
13 | 61a3ac462139 |
14 | 2a058d5a3aab |
15 | 1412066cbcb1 |
hex | a0123195da7 |
11000000109991 has 2 divisors, whose sum is σ = 11000000109992. Its totient is φ = 11000000109990.
The previous prime is 11000000109979. The next prime is 11000000109997. The reversal of 11000000109991 is 19990100000011.
It is a strong prime.
It is an emirp because it is prime and its reverse (19990100000011) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 11000000109991 - 237 = 10862561156519 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11000000109997) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5500000054995 + 5500000054996.
It is an arithmetic number, because the mean of its divisors is an integer number (5500000054996).
Almost surely, 211000000109991 is an apocalyptic number.
11000000109991 is a deficient number, since it is larger than the sum of its proper divisors (1).
11000000109991 is an equidigital number, since it uses as much as digits as its factorization.
11000000109991 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 729, while the sum is 31.
The spelling of 11000000109991 in words is "eleven trillion, one hundred nine thousand, nine hundred ninety-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •