Base | Representation |
---|---|
bin | 1010000011011111001000… |
… | …00000110110010000110110 |
3 | 2220021200211110022010112020 |
4 | 11001233210000312100312 |
5 | 10344222311124200042 |
6 | 115005112014334010 |
7 | 4441252646653653 |
oct | 501574400662066 |
9 | 86250743263466 |
10 | 22110022100022 |
11 | 705489808300a |
12 | 25910a17ba306 |
13 | c44c737b222c |
14 | 5661b8c04c2a |
15 | 2851ebd743ec |
hex | 141be4036436 |
22110022100022 has 16 divisors (see below), whose sum is σ = 44752815817920. Its totient is φ = 7281212097032.
The previous prime is 22110022099999. The next prime is 22110022100071. The reversal of 22110022100022 is 22000122001122.
It is a super-2 number, since 2×221100221000222 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 22110022099974 and 22110022100010.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 22198816872 + ... + 22198817867.
It is an arithmetic number, because the mean of its divisors is an integer number (2797050988620).
Almost surely, 222110022100022 is an apocalyptic number.
22110022100022 is an abundant number, since it is smaller than the sum of its proper divisors (22642793717898).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
22110022100022 is a wasteful number, since it uses less digits than its factorization.
22110022100022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 44397634827.
The product of its (nonzero) digits is 64, while the sum is 15.
Adding to 22110022100022 its reverse (22000122001122), we get a palindrome (44110144101144).
The spelling of 22110022100022 in words is "twenty-two trillion, one hundred ten billion, twenty-two million, one hundred thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.032 sec. • engine limits •