Base | Representation |
---|---|
bin | 11001011111010011010100… |
… | …100010011011010001110110 |
3 | 112200220212101220201101200202 |
4 | 121133103110202123101312 |
5 | 104143140312312020042 |
6 | 1034231013443240502 |
7 | 32420055215536313 |
oct | 3137232442332166 |
9 | 480825356641622 |
10 | 112102212220022 |
11 | 327a0310332792 |
12 | 106a61b0079132 |
13 | 4a72268764a9b |
14 | 1d97ac158dd0a |
15 | ce6080c5c632 |
hex | 65f4d489b476 |
112102212220022 has 32 divisors (see below), whose sum is σ = 168904070056800. Its totient is φ = 55801373741568.
The previous prime is 112102212220001. The next prime is 112102212220043. The reversal of 112102212220022 is 220022212201211.
It is an interprime number because it is at equal distance from previous prime (112102212220001) and next prime (112102212220043).
It is a super-3 number, since 3×1121022122200223 (a number of 43 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 112102212219976 and 112102212220003.
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, 5513303768 + ... + 5513324100.
It is an arithmetic number, because the mean of its divisors is an integer number (5278252189275).
Almost surely, 2112102212220022 is an apocalyptic number.
112102212220022 is a deficient number, since it is larger than the sum of its proper divisors (56801857836778).
112102212220022 is a wasteful number, since it uses less digits than its factorization.
112102212220022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 32480.
The product of its (nonzero) digits is 256, while the sum is 20.
Adding to 112102212220022 its reverse (220022212201211), we get a palindrome (332124424421233).
The spelling of 112102212220022 in words is "one hundred twelve trillion, one hundred two billion, two hundred twelve million, two hundred twenty thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •