Base | Representation |
---|---|
bin | 1010001101000110100100… |
… | …1110111110010100101010 |
3 | 1110201122100102122101101022 |
4 | 2203101221032332110222 |
5 | 2432313002322010442 |
6 | 35510255320452442 |
7 | 2235430341216602 |
oct | 243215116762452 |
9 | 43648312571338 |
10 | 11220220110122 |
11 | 3636517818121 |
12 | 131267901a122 |
13 | 6350a68c671a |
14 | 2ab0c0c77c02 |
15 | 146ce4d773d2 |
hex | a34693be52a |
11220220110122 has 4 divisors (see below), whose sum is σ = 16830330165186. Its totient is φ = 5610110055060.
The previous prime is 11220220110059. The next prime is 11220220110139. The reversal of 11220220110122 is 22101102202211.
11220220110122 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in only one way, i.e., 10636736482801 + 583483627321 = 3261401^2 + 763861^2 .
It is a super-2 number, since 2×112202201101222 (a number of 27 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 11220220110122.
It is an unprimeable number.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2805055027529 + ... + 2805055027532.
Almost surely, 211220220110122 is an apocalyptic number.
11220220110122 is a deficient number, since it is larger than the sum of its proper divisors (5610110055064).
11220220110122 is an equidigital number, since it uses as much as digits as its factorization.
11220220110122 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5610110055063.
The product of its (nonzero) digits is 64, while the sum is 17.
Adding to 11220220110122 its reverse (22101102202211), we get a palindrome (33321322312333).
The spelling of 11220220110122 in words is "eleven trillion, two hundred twenty billion, two hundred twenty million, one hundred ten thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •