Base | Representation |
---|---|
bin | 1010000001100100111011… |
… | …1011000111000111001011 |
3 | 1110000201020210001201222211 |
4 | 2200121032323013013023 |
5 | 2421041441302400021 |
6 | 35235311121125551 |
7 | 2215220433601123 |
oct | 240311673070713 |
9 | 43021223051884 |
10 | 11022210200011 |
11 | 356a547344a0a |
12 | 12a0217a898b7 |
13 | 61c50b991c3a |
14 | 2a16991d1c83 |
15 | 141aa64a93e1 |
hex | a064eec71cb |
11022210200011 has 16 divisors (see below), whose sum is σ = 11804329774080. Its totient is φ = 10255533603840.
The previous prime is 11022210199921. The next prime is 11022210200021. The reversal of 11022210200011 is 11000201222011.
11022210200011 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 11022210200011 - 217 = 11022210068939 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11022210199964 and 11022210200000.
It is not an unprimeable number, because it can be changed into a prime (11022210200021) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 8477376 + ... + 9690733.
It is an arithmetic number, because the mean of its divisors is an integer number (737770610880).
Almost surely, 211022210200011 is an apocalyptic number.
11022210200011 is a deficient number, since it is larger than the sum of its proper divisors (782119574069).
11022210200011 is a wasteful number, since it uses less digits than its factorization.
11022210200011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 18168534.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 11022210200011 its reverse (11000201222011), we get a palindrome (22022411422022).
The spelling of 11022210200011 in words is "eleven trillion, twenty-two billion, two hundred ten million, two hundred thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •