Base | Representation |
---|---|
bin | 1010001100100001010000… |
… | …0000000101111010011101 |
3 | 1110200200111010102202221011 |
4 | 2203020110000011322131 |
5 | 2432131442223223401 |
6 | 35501521143335221 |
7 | 2234624132406163 |
oct | 243102400057235 |
9 | 43620433382834 |
10 | 11210200211101 |
11 | 3632245851741 |
12 | 1310741451511 |
13 | 63416aa5caa8 |
14 | 2aa810215233 |
15 | 14690a388451 |
hex | a3214005e9d |
11210200211101 has 12 divisors (see below), whose sum is σ = 11619582635232. Its totient is φ = 10814790515984.
The previous prime is 11210200211033. The next prime is 11210200211137. The reversal of 11210200211101 is 10111200201211.
It is a happy number.
It is not a de Polignac number, because 11210200211101 - 27 = 11210200210973 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11210200251101) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 4421011 + ... + 6478096.
It is an arithmetic number, because the mean of its divisors is an integer number (968298552936).
Almost surely, 211210200211101 is an apocalyptic number.
It is an amenable number.
11210200211101 is a deficient number, since it is larger than the sum of its proper divisors (409382424131).
11210200211101 is a wasteful number, since it uses less digits than its factorization.
11210200211101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10900388 (or 10900359 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 11210200211101 its reverse (10111200201211), we get a palindrome (21321400412312).
The spelling of 11210200211101 in words is "eleven trillion, two hundred ten billion, two hundred million, two hundred eleven thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •