Base | Representation |
---|---|
bin | 1010001101000110001011… |
… | …0011011010000000110011 |
3 | 1110201122001220122000020200 |
4 | 2203101202303122000303 |
5 | 2432312242212021321 |
6 | 35510240504210243 |
7 | 2235424561164006 |
oct | 243214263320063 |
9 | 43648056560220 |
10 | 11220112220211 |
11 | 3636471927904 |
12 | 1312648a69983 |
13 | 63508a44c93b |
14 | 2ab0b07d153d |
15 | 146cda664d26 |
hex | a3462cda033 |
11220112220211 has 12 divisors (see below), whose sum is σ = 16207497373080. Its totient is φ = 7479766224000.
The previous prime is 11220112220209. The next prime is 11220112220227. The reversal of 11220112220211 is 11202221102211.
11220112220211 is a `hidden beast` number, since 1 + 1 + 220 + 1 + 12 + 220 + 211 = 666.
It is not a de Polignac number, because 11220112220211 - 21 = 11220112220209 is a prime.
It is not an unprimeable number, because it can be changed into a prime (11220112220201) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 25485406 + ... + 25921923.
It is an arithmetic number, because the mean of its divisors is an integer number (1350624781090).
Almost surely, 211220112220211 is an apocalyptic number.
11220112220211 is a deficient number, since it is larger than the sum of its proper divisors (4987385152869).
11220112220211 is a wasteful number, since it uses less digits than its factorization.
11220112220211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 51431586 (or 51431583 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 18.
Adding to 11220112220211 its reverse (11202221102211), we get a palindrome (22422333322422).
The spelling of 11220112220211 in words is "eleven trillion, two hundred twenty billion, one hundred twelve million, two hundred twenty thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •