Base | Representation |
---|---|
bin | 11001011101111101100010… |
… | …111000100111011101000101 |
3 | 112200121001200020020210212022 |
4 | 121131331202320213131011 |
5 | 104140133201421334341 |
6 | 1034120422405132525 |
7 | 32410314654241265 |
oct | 3135754270473505 |
9 | 480531606223768 |
10 | 112010111121221 |
11 | 327652486a3005 |
12 | 106903876ba145 |
13 | 4a6667b55b7a1 |
14 | 1d934655db7a5 |
15 | ce39901ece4b |
hex | 65df62e27745 |
112010111121221 has 16 divisors (see below), whose sum is σ = 114455303748864. Its totient is φ = 109567513626624.
The previous prime is 112010111121193. The next prime is 112010111121247. The reversal of 112010111121221 is 122121111010211.
It is a cyclic number.
It is not a de Polignac number, because 112010111121221 - 210 = 112010111120197 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 112010111121221.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (112010111121281) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 948833426 + ... + 948951468.
It is an arithmetic number, because the mean of its divisors is an integer number (7153456484304).
Almost surely, 2112010111121221 is an apocalyptic number.
It is an amenable number.
112010111121221 is a deficient number, since it is larger than the sum of its proper divisors (2445192627643).
112010111121221 is a wasteful number, since it uses less digits than its factorization.
112010111121221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 128860.
The product of its (nonzero) digits is 16, while the sum is 17.
Adding to 112010111121221 its reverse (122121111010211), we get a palindrome (234131222131432).
The spelling of 112010111121221 in words is "one hundred twelve trillion, ten billion, one hundred eleven million, one hundred twenty-one thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •