Base | Representation |
---|---|
bin | 11001011111010011010100… |
… | …100010010110111011101110 |
3 | 112200220212101220200111021111 |
4 | 121133103110202112323232 |
5 | 104143140312310432342 |
6 | 1034231013443022234 |
7 | 32420055215433364 |
oct | 3137232442267356 |
9 | 480825356614244 |
10 | 112102212202222 |
11 | 327a0310320380 |
12 | 106a61b006a97a |
13 | 4a72268759958 |
14 | 1d97ac1587634 |
15 | ce6080c57217 |
hex | 65f4d4896eee |
112102212202222 has 32 divisors (see below), whose sum is σ = 183609649367424. Its totient is φ = 50908424767200.
The previous prime is 112102212202199. The next prime is 112102212202237. The reversal of 112102212202222 is 222202212201211.
It is a super-3 number, since 3×1121022122022223 (a number of 43 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Harshad number since it is a multiple of its sum of digits (22).
It is a junction number, because it is equal to n+sod(n) for n = 112102212202193 and 112102212202202.
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, 953864608 + ... + 953982124.
It is an arithmetic number, because the mean of its divisors is an integer number (5737801542732).
Almost surely, 2112102212202222 is an apocalyptic number.
112102212202222 is a deficient number, since it is larger than the sum of its proper divisors (71507437165202).
112102212202222 is a wasteful number, since it uses less digits than its factorization.
112102212202222 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 157264.
The product of its (nonzero) digits is 512, while the sum is 22.
Adding to 112102212202222 its reverse (222202212201211), we get a palindrome (334304424403433).
The spelling of 112102212202222 in words is "one hundred twelve trillion, one hundred two billion, two hundred twelve million, two hundred two thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.024 sec. • engine limits •