Base | Representation |
---|---|
bin | 10100111001100010… |
… | …10111011010000110 |
3 | 1001221221122012210021 |
4 | 22130301113122012 |
5 | 140434322334342 |
6 | 5053210045354 |
7 | 545021312452 |
oct | 123461273206 |
9 | 31857565707 |
10 | 11220121222 |
11 | 4838514162 |
12 | 221171985a |
13 | 109a7082ab |
14 | 78620d662 |
15 | 45a070567 |
hex | 29cc57686 |
11220121222 has 8 divisors (see below), whose sum is σ = 16987473576. Its totient is φ = 5557630032.
The previous prime is 11220121219. The next prime is 11220121249. The reversal of 11220121222 is 22212102211.
It is a happy number.
11220121222 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 super-2 number, since 2×112201212222 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 11220121196 and 11220121205.
It is a congruent number.
It is an unprimeable number.
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 3 ways as a sum of consecutive naturals, for example, 26215023 + ... + 26215450.
It is an arithmetic number, because the mean of its divisors is an integer number (2123434197).
Almost surely, 211220121222 is an apocalyptic number.
11220121222 is a deficient number, since it is larger than the sum of its proper divisors (5767352354).
11220121222 is a wasteful number, since it uses less digits than its factorization.
11220121222 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 52430582.
The product of its (nonzero) digits is 64, while the sum is 16.
Adding to 11220121222 its reverse (22212102211), we get a palindrome (33432223433).
The spelling of 11220121222 in words is "eleven billion, two hundred twenty million, one hundred twenty-one thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •