Base | Representation |
---|---|
bin | 1010001101001010010011… |
… | …1101101001001110010011 |
3 | 1110201201221021020211120001 |
4 | 2203102210331221032103 |
5 | 2432322030340401321 |
6 | 35510542555030431 |
7 | 2235464226644212 |
oct | 243224475511623 |
9 | 43651837224501 |
10 | 11221222200211 |
11 | 3636991439251 |
12 | 13128b873b417 |
13 | 6352063b603a |
14 | 2ab177dab079 |
15 | 146d52d1cc91 |
hex | a34a4f69393 |
11221222200211 has 8 divisors (see below), whose sum is σ = 11608288902000. Its totient is φ = 10834164032160.
The previous prime is 11221222200179. The next prime is 11221222200263. The reversal of 11221222200211 is 11200222212211.
11221222200211 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 11221222200211 - 25 = 11221222200179 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11221222200281) 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, 601201 + ... + 4775341.
It is an arithmetic number, because the mean of its divisors is an integer number (1451036112750).
Almost surely, 211221222200211 is an apocalyptic number.
11221222200211 is a deficient number, since it is larger than the sum of its proper divisors (387066701789).
11221222200211 is an equidigital number, since it uses as much as digits as its factorization.
11221222200211 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4266869.
The product of its (nonzero) digits is 128, while the sum is 19.
Adding to 11221222200211 its reverse (11200222212211), we get a palindrome (22421444412422).
The spelling of 11221222200211 in words is "eleven trillion, two hundred twenty-one billion, two hundred twenty-two million, two hundred thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.165 sec. • engine limits •