Base | Representation |
---|---|
bin | 1010000000111111010001… |
… | …1100001001101011001011 |
3 | 1102222202011100002010201110 |
4 | 2200033310130021223023 |
5 | 2420410241130400021 |
6 | 35230520115421403 |
7 | 2214412105164303 |
oct | 240176434115313 |
9 | 42882140063643 |
10 | 11012102200011 |
11 | 356622a674a00 |
12 | 129a2768b4863 |
13 | 61b58a7bc853 |
14 | 2a0dba998603 |
15 | 1416b3db6476 |
hex | a03f4709acb |
11012102200011 has 48 divisors (see below), whose sum is σ = 16179202811520. Its totient is φ = 6657367516800.
The previous prime is 11012102200007. The next prime is 11012102200013. The reversal of 11012102200011 is 11000220121011.
It is not a de Polignac number, because 11012102200011 - 22 = 11012102200007 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 11012102200011.
It is not an unprimeable number, because it can be changed into a prime (11012102200013) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 426498660 + ... + 426524478.
It is an arithmetic number, because the mean of its divisors is an integer number (337066725240).
Almost surely, 211012102200011 is an apocalyptic number.
11012102200011 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
11012102200011 is a deficient number, since it is larger than the sum of its proper divisors (5167100611509).
11012102200011 is a wasteful number, since it uses less digits than its factorization.
11012102200011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 28728 (or 28717 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 11012102200011 its reverse (11000220121011), we get a palindrome (22012322321022).
The spelling of 11012102200011 in words is "eleven trillion, twelve billion, one hundred two million, two hundred thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •