Base | Representation |
---|---|
bin | 1010001101000110100010… |
… | …1000110010011111110011 |
3 | 1110201122022201210211100212 |
4 | 2203101220220302133303 |
5 | 2432312442241201321 |
6 | 35510254322134335 |
7 | 2235430160146310 |
oct | 243215050623763 |
9 | 43648281724325 |
10 | 11220210100211 |
11 | 3636512100572 |
12 | 13126757b13ab |
13 | 6350a48004b8 |
14 | 2ab0bd7cdd07 |
15 | 146ce404b55b |
hex | a3468a327f3 |
11220210100211 has 32 divisors (see below), whose sum is σ = 13408259529600. Its totient is φ = 9185760460800.
The previous prime is 11220210100201. The next prime is 11220210100241. The reversal of 11220210100211 is 11200101202211.
11220210100211 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a de Polignac number, because none of the positive numbers 2k-11220210100211 is a prime.
It is a super-2 number, since 2×112202101002112 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11220210100201) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 23402645 + ... + 23877273.
It is an arithmetic number, because the mean of its divisors is an integer number (419008110300).
Almost surely, 211220210100211 is an apocalyptic number.
11220210100211 is a deficient number, since it is larger than the sum of its proper divisors (2188049429389).
11220210100211 is a wasteful number, since it uses less digits than its factorization.
11220210100211 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 475919.
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 11220210100211 its reverse (11200101202211), we get a palindrome (22420311302422).
The spelling of 11220210100211 in words is "eleven trillion, two hundred twenty billion, two hundred ten million, one hundred thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •