Base | Representation |
---|---|
bin | 11001100000111000101111… |
… | …011110001101000000000110 |
3 | 112201022021111022220112010202 |
4 | 121200320233132031000012 |
5 | 104201431324134201042 |
6 | 1034353023452050502 |
7 | 32430661650560366 |
oct | 3140705736150006 |
9 | 481267438815122 |
10 | 112211112022022 |
11 | 32832513442852 |
12 | 10703322463a32 |
13 | 4a7c602041b50 |
14 | 1d9d0925c29a6 |
15 | ce8d06480632 |
hex | 660e2f78d006 |
112211112022022 has 8 divisors (see below), whose sum is σ = 181264104035616. Its totient is φ = 51789744010152.
The previous prime is 112211112022013. The next prime is 112211112022027. The reversal of 112211112022022 is 220220211112211.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×1122111120220222 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 112211112021985 and 112211112022003.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (112211112022027) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2157906000398 + ... + 2157906000449.
It is an arithmetic number, because the mean of its divisors is an integer number (22658013004452).
Almost surely, 2112211112022022 is an apocalyptic number.
112211112022022 is a deficient number, since it is larger than the sum of its proper divisors (69052992013594).
112211112022022 is a wasteful number, since it uses less digits than its factorization.
112211112022022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4315812000862.
The product of its (nonzero) digits is 128, while the sum is 20.
Adding to 112211112022022 its reverse (220220211112211), we get a palindrome (332431323134233).
The spelling of 112211112022022 in words is "one hundred twelve trillion, two hundred eleven billion, one hundred twelve million, twenty-two thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •