Base | Representation |
---|---|
bin | 1010000001100100001001… |
… | …1101100010101110101110 |
3 | 1110000200201012122111012000 |
4 | 2200121002131202232232 |
5 | 2421041024241402342 |
6 | 35235234251553130 |
7 | 2215212314504646 |
oct | 240310235425656 |
9 | 43020635574160 |
10 | 11022001122222 |
11 | 356a44a321752 |
12 | 12a0179a5b7a6 |
13 | 61c4a7579a7c |
14 | 2a1679529526 |
15 | 141a92e5a44c |
hex | a0642762bae |
11022001122222 has 32 divisors (see below), whose sum is σ = 24493659724800. Its totient is φ = 3673951789464.
The previous prime is 11022001122203. The next prime is 11022001122311. The reversal of 11022001122222 is 22222110022011.
It is a happy number.
11022001122222 is a `hidden beast` number, since 110 + 220 + 0 + 112 + 2 + 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 = 11022001122195 and 11022001122204.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2894179 + ... + 5515457.
It is an arithmetic number, because the mean of its divisors is an integer number (765426866400).
Almost surely, 211022001122222 is an apocalyptic number.
11022001122222 is an abundant number, since it is smaller than the sum of its proper divisors (13471658602578).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11022001122222 is a wasteful number, since it uses less digits than its factorization.
11022001122222 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2699157 (or 2699151 counting only the distinct ones).
The product of its (nonzero) digits is 128, while the sum is 18.
Adding to 11022001122222 its reverse (22222110022011), we get a palindrome (33244111144233).
The spelling of 11022001122222 in words is "eleven trillion, twenty-two billion, one million, one hundred twenty-two thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •