Base | Representation |
---|---|
bin | 1010001101001010010011… |
… | …1001110111101110000011 |
3 | 1110201201221012101120122000 |
4 | 2203102210321313232003 |
5 | 2432322030112223021 |
6 | 35510542521515043 |
7 | 2235464215354230 |
oct | 243224471675603 |
9 | 43651835346560 |
10 | 11221221211011 |
11 | 3636990923029 |
12 | 13128b8342a83 |
13 | 63520612aa06 |
14 | 2ab177bd0787 |
15 | 146d52bc4b26 |
hex | a34a4e77b83 |
11221221211011 has 32 divisors (see below), whose sum is σ = 19000576358400. Its totient is φ = 6411558291840.
The previous prime is 11221221210943. The next prime is 11221221211033. The reversal of 11221221211011 is 11011212212211.
It is a happy number.
11221221211011 is a `hidden beast` number, since 1 + 1 + 221 + 221 + 211 + 0 + 11 = 666.
It is not a de Polignac number, because 11221221211011 - 27 = 11221221210883 is a prime.
It is not an unprimeable number, because it can be changed into a prime (11221221211111) 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 31 ways as a sum of consecutive naturals, for example, 486726 + ... + 4762283.
It is an arithmetic number, because the mean of its divisors is an integer number (593768011200).
Almost surely, 211221221211011 is an apocalyptic number.
11221221211011 is a deficient number, since it is larger than the sum of its proper divisors (7779355147389).
11221221211011 is a wasteful number, since it uses less digits than its factorization.
11221221211011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5260336 (or 5260330 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 18.
Adding to 11221221211011 its reverse (11011212212211), we get a palindrome (22232433423222).
The spelling of 11221221211011 in words is "eleven trillion, two hundred twenty-one billion, two hundred twenty-one million, two hundred eleven thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •