Base | Representation |
---|---|
bin | 1010001101001110000001… |
… | …1100011010010001111011 |
3 | 1110201211111211000110211002 |
4 | 2203103200130122101323 |
5 | 2432331101322334321 |
6 | 35511230003555215 |
7 | 2235531035065661 |
oct | 243234034322173 |
9 | 43654454013732 |
10 | 11222220121211 |
11 | 3637353772050 |
12 | 1312b3698bb0b |
13 | 635335075b38 |
14 | 2ab230736c31 |
15 | 146db073d20b |
hex | a34e071a47b |
11222220121211 has 8 divisors (see below), whose sum is σ = 12473411044464. Its totient is φ = 10009527380320.
The previous prime is 11222220121193. The next prime is 11222220121213. The reversal of 11222220121211 is 11212102222211.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11222220121211 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11222220121213) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 9624544976 + ... + 9624546141.
It is an arithmetic number, because the mean of its divisors is an integer number (1559176380558).
Almost surely, 211222220121211 is an apocalyptic number.
11222220121211 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
11222220121211 is a deficient number, since it is larger than the sum of its proper divisors (1251190923253).
11222220121211 is a wasteful number, since it uses less digits than its factorization.
11222220121211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19249091181.
The product of its (nonzero) digits is 128, while the sum is 20.
Adding to 11222220121211 its reverse (11212102222211), we get a palindrome (22434322343422).
The spelling of 11222220121211 in words is "eleven trillion, two hundred twenty-two billion, two hundred twenty million, one hundred twenty-one thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •