Base | Representation |
---|---|
bin | 11001011110001000101101… |
… | …100110100111001100100011 |
3 | 112200122012121220102012112021 |
4 | 121132020231212213030203 |
5 | 104140332231120023021 |
6 | 1034130124313442311 |
7 | 32411221056050221 |
oct | 3136105546471443 |
9 | 480565556365467 |
10 | 112022102111011 |
11 | 3276a341260124 |
12 | 10692773410397 |
13 | 4a6783c88a111 |
14 | 1d93c81d51b11 |
15 | ce3e42c8dc41 |
hex | 65e22d9a7323 |
112022102111011 has 8 divisors (see below), whose sum is σ = 112351294400544. Its totient is φ = 111693347288640.
The previous prime is 112022102110987. The next prime is 112022102111063. The reversal of 112022102111011 is 110111201220211.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 112022102111011 - 25 = 112022102110979 is a prime.
It is a super-2 number, since 2×1120221021110112 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (112022102114011) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 108853896 + ... + 109878181.
It is an arithmetic number, because the mean of its divisors is an integer number (14043911800068).
Almost surely, 2112022102111011 is an apocalyptic number.
112022102111011 is a deficient number, since it is larger than the sum of its proper divisors (329192289533).
112022102111011 is an equidigital number, since it uses as much as digits as its factorization.
112022102111011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 218733581.
The product of its (nonzero) digits is 16, while the sum is 16.
Adding to 112022102111011 its reverse (110111201220211), we get a palindrome (222133303331222).
The spelling of 112022102111011 in words is "one hundred twelve trillion, twenty-two billion, one hundred two million, one hundred eleven thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •