Base | Representation |
---|---|
bin | 1010001100101000110001… |
… | …1001000001011010110011 |
3 | 1110200212200220001022011200 |
4 | 2203022030121001122303 |
5 | 2432200111310342321 |
6 | 35502453414542243 |
7 | 2235025156421151 |
oct | 243121431013263 |
9 | 43625626038150 |
10 | 11212220012211 |
11 | 3633091993159 |
12 | 1311005967983 |
13 | 63440034ab8a |
14 | 2aa9625863d1 |
15 | 1469c785cd26 |
hex | a328c6416b3 |
11212220012211 has 12 divisors (see below), whose sum is σ = 16633143201792. Its totient is φ = 7272791359056.
The previous prime is 11212220012197. The next prime is 11212220012239. The reversal of 11212220012211 is 11221002221211.
11212220012211 is a `hidden beast` number, since 11 + 212 + 220 + 0 + 1 + 221 + 1 = 666.
It is not a de Polignac number, because 11212220012211 - 25 = 11212220012179 is a prime.
It is not an unprimeable number, because it can be changed into a prime (11212220012261) 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, 16835164851 + ... + 16835165516.
It is an arithmetic number, because the mean of its divisors is an integer number (1386095266816).
Almost surely, 211212220012211 is an apocalyptic number.
11212220012211 is a deficient number, since it is larger than the sum of its proper divisors (5420923189581).
11212220012211 is a wasteful number, since it uses less digits than its factorization.
11212220012211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 33670330410 (or 33670330407 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 18.
Adding to 11212220012211 its reverse (11221002221211), we get a palindrome (22433222233422).
The spelling of 11212220012211 in words is "eleven trillion, two hundred twelve billion, two hundred twenty million, twelve thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •