Base | Representation |
---|---|
bin | 1010000000010010001100… |
… | …0110101110100100010110 |
3 | 1102221120220221001102001110 |
4 | 2200010203012232210112 |
5 | 2420211000023224342 |
6 | 35221155204035450 |
7 | 2213503155033201 |
oct | 240044306564426 |
9 | 42846827042043 |
10 | 11000000211222 |
11 | 356108a393680 |
12 | 1297a59992b86 |
13 | 61a3ac499239 |
14 | 2a058d5cc938 |
15 | 1412066ebc9c |
hex | a01231ae916 |
11000000211222 has 64 divisors (see below), whose sum is σ = 25945946553600. Its totient is φ = 3072546276480.
The previous prime is 11000000211209. The next prime is 11000000211223. The reversal of 11000000211222 is 22211200000011.
It is a super-2 number, since 2×110000002112222 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 11000000211198 and 11000000211207.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11000000211223) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 118493197 + ... + 118585992.
It is an arithmetic number, because the mean of its divisors is an integer number (405405414900).
Almost surely, 211000000211222 is an apocalyptic number.
11000000211222 is an abundant number, since it is smaller than the sum of its proper divisors (14945946342378).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11000000211222 is a wasteful number, since it uses less digits than its factorization.
11000000211222 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 237079261.
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 11000000211222 its reverse (22211200000011), we get a palindrome (33211200211233).
The spelling of 11000000211222 in words is "eleven trillion, two hundred eleven thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •