Base | Representation |
---|---|
bin | 11001011111011010101011… |
… | …111000010010111111111011 |
3 | 112200221121211000122100200220 |
4 | 121133122223320102333323 |
5 | 104143303011211201021 |
6 | 1034234402251031123 |
7 | 32420455200000516 |
oct | 3137325370227773 |
9 | 480847730570626 |
10 | 112110120022011 |
11 | 327a36a9058431 |
12 | 106a783843b4a3 |
13 | 4a72c28b66667 |
14 | 1d982318d7d7d |
15 | ce63950e4cc6 |
hex | 65f6abe12ffb |
112110120022011 has 32 divisors (see below), whose sum is σ = 155711128688640. Its totient is φ = 71668985740800.
The previous prime is 112110120022001. The next prime is 112110120022057. The reversal of 112110120022011 is 110220021011211.
It is a happy number.
It is not a de Polignac number, because 112110120022011 - 27 = 112110120021883 is a prime.
It is a super-2 number, since 2×1121101200220112 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (112110120022001) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 36143200 + ... + 39122258.
It is an arithmetic number, because the mean of its divisors is an integer number (4865972771520).
Almost surely, 2112110120022011 is an apocalyptic number.
112110120022011 is a deficient number, since it is larger than the sum of its proper divisors (43601008666629).
112110120022011 is a wasteful number, since it uses less digits than its factorization.
112110120022011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2982787.
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 112110120022011 its reverse (110220021011211), we get a palindrome (222330141033222).
The spelling of 112110120022011 in words is "one hundred twelve trillion, one hundred ten billion, one hundred twenty million, twenty-two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •