Base | Representation |
---|---|
bin | 1010000000111110111001… |
… | …1110101011100111001011 |
3 | 1102222201220100220121111202 |
4 | 2200033232132223213023 |
5 | 2420410040030400021 |
6 | 35230502144214415 |
7 | 2214406452202151 |
oct | 240175636534713 |
9 | 42881810817452 |
10 | 11012002200011 |
11 | 356618918347a |
12 | 129a24930a40b |
13 | 61b572b79057 |
14 | 2a0dab5a73d1 |
15 | 1416aa211a0b |
hex | a03ee7ab9cb |
11012002200011 has 2 divisors, whose sum is σ = 11012002200012. Its totient is φ = 11012002200010.
The previous prime is 11012002199993. The next prime is 11012002200019. The reversal of 11012002200011 is 11000220021011.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11012002200011 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11012002199965 and 11012002200001.
It is not a weakly prime, because it can be changed into another prime (11012002200019) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5506001100005 + 5506001100006.
It is an arithmetic number, because the mean of its divisors is an integer number (5506001100006).
Almost surely, 211012002200011 is an apocalyptic number.
11012002200011 is a deficient number, since it is larger than the sum of its proper divisors (1).
11012002200011 is an equidigital number, since it uses as much as digits as its factorization.
11012002200011 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 11012002200011 its reverse (11000220021011), we get a palindrome (22012222221022).
The spelling of 11012002200011 in words is "eleven trillion, twelve billion, two million, two hundred thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •