Base | Representation |
---|---|
bin | 1001010010111001001101… |
… | …1001110011001010100111 |
3 | 1100012001010022202222120212 |
4 | 2110232103121303022213 |
5 | 2314421432223223421 |
6 | 33423032315450035 |
7 | 2103246042302132 |
oct | 224562331631247 |
9 | 40161108688525 |
10 | 10220200211111 |
11 | 32903a9640870 |
12 | 11908b045691b |
13 | 5919b7481727 |
14 | 274935d31219 |
15 | 12acb69cee5b |
hex | 94b936732a7 |
10220200211111 has 64 divisors (see below), whose sum is σ = 12069038446080. Its totient is φ = 8554528765440.
The previous prime is 10220200211107. The next prime is 10220200211129. The reversal of 10220200211111 is 11111200202201.
It is a cyclic number.
It is not a de Polignac number, because 10220200211111 - 22 = 10220200211107 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10220200211141) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 2123454941 + ... + 2123459753.
It is an arithmetic number, because the mean of its divisors is an integer number (188578725720).
Almost surely, 210220200211111 is an apocalyptic number.
10220200211111 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
10220200211111 is a deficient number, since it is larger than the sum of its proper divisors (1848838234969).
10220200211111 is a wasteful number, since it uses less digits than its factorization.
10220200211111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6016.
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 10220200211111 its reverse (11111200202201), we get a palindrome (21331400413312).
The spelling of 10220200211111 in words is "ten trillion, two hundred twenty billion, two hundred million, two hundred eleven thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •