Base | Representation |
---|---|
bin | 1010001101000110001101… |
… | …0101010111010110100011 |
3 | 1110201122002112101021111101 |
4 | 2203101203111113112203 |
5 | 2432312302001402321 |
6 | 35510241423055231 |
7 | 2235425026641241 |
oct | 243214325272643 |
9 | 43648075337441 |
10 | 11220121122211 |
11 | 3636476958031 |
12 | 131264ba41517 |
13 | 63508c2487b1 |
14 | 2ab0b1a6b791 |
15 | 146cdb322791 |
hex | a34635575a3 |
11220121122211 has 2 divisors, whose sum is σ = 11220121122212. Its totient is φ = 11220121122210.
The previous prime is 11220121122193. The next prime is 11220121122233. The reversal of 11220121122211 is 11222112102211.
It is a happy number.
11220121122211 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 11220121122211 - 213 = 11220121114019 is a prime.
It is a super-2 number, since 2×112201211222112 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (11220121182211) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5610060561105 + 5610060561106.
It is an arithmetic number, because the mean of its divisors is an integer number (5610060561106).
Almost surely, 211220121122211 is an apocalyptic number.
11220121122211 is a deficient number, since it is larger than the sum of its proper divisors (1).
11220121122211 is an equidigital number, since it uses as much as digits as its factorization.
11220121122211 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 64, while the sum is 19.
Adding to 11220121122211 its reverse (11222112102211), we get a palindrome (22442233224422).
The spelling of 11220121122211 in words is "eleven trillion, two hundred twenty billion, one hundred twenty-one million, one hundred twenty-two thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •