Base | Representation |
---|---|
bin | 1010000001100100111011… |
… | …1110111011010011011110 |
3 | 1110000201020211221120000200 |
4 | 2200121032332323103132 |
5 | 2421041442031401342 |
6 | 35235311154404330 |
7 | 2215220445235155 |
oct | 240311676732336 |
9 | 43021224846020 |
10 | 11022211200222 |
11 | 356a547968432 |
12 | 12a02182906a6 |
13 | 61c50bc52291 |
14 | 2a16993b259c |
15 | 141aa660594c |
hex | a064efbb4de |
11022211200222 has 24 divisors (see below), whose sum is σ = 24526902401976. Its totient is φ = 3574771199856.
The previous prime is 11022211200199. The next prime is 11022211200239. The reversal of 11022211200222 is 22200211222011.
It is a happy number.
11022211200222 is a `hidden beast` number, since 1 + 10 + 22 + 211 + 200 + 222 = 666.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a junction number, because it is equal to n+sod(n) for n = 11022211200195 and 11022211200204.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 8274932668 + ... + 8274933999.
It is an arithmetic number, because the mean of its divisors is an integer number (1021954266749).
Almost surely, 211022211200222 is an apocalyptic number.
11022211200222 is an abundant number, since it is smaller than the sum of its proper divisors (13504691201754).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11022211200222 is a wasteful number, since it uses less digits than its factorization.
11022211200222 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16549866712 (or 16549866709 counting only the distinct ones).
The product of its (nonzero) digits is 128, while the sum is 18.
Adding to 11022211200222 its reverse (22200211222011), we get a palindrome (33222422422233).
The spelling of 11022211200222 in words is "eleven trillion, twenty-two billion, two hundred eleven million, two hundred thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •