Base | Representation |
---|---|
bin | 11001011111011100101110… |
… | …011110101000100111101001 |
3 | 112200221211110201120011112101 |
4 | 121133130232132220213221 |
5 | 104143322003121010441 |
6 | 1034235403521413401 |
7 | 32420563403641510 |
oct | 3137345636504751 |
9 | 480854421504471 |
10 | 112112311110121 |
11 | 327a4622950353 |
12 | 106a814a19a261 |
13 | 4a731b7a977ba |
14 | 1d9839c8d5677 |
15 | ce6472651231 |
hex | 65f72e7a89e9 |
112112311110121 has 16 divisors (see below), whose sum is σ = 128249397100800. Its totient is φ = 96005491315200.
The previous prime is 112112311110109. The next prime is 112112311110131. The reversal of 112112311110121 is 121011113211211.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 112112311110121 - 229 = 112111774239209 is a prime.
It is a super-2 number, since 2×1121123111101212 (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 (112112311110101) 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, 248581980 + ... + 249032578.
It is an arithmetic number, because the mean of its divisors is an integer number (8015587318800).
Almost surely, 2112112311110121 is an apocalyptic number.
It is an amenable number.
112112311110121 is a deficient number, since it is larger than the sum of its proper divisors (16137085990679).
112112311110121 is a wasteful number, since it uses less digits than its factorization.
112112311110121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 484104.
The product of its (nonzero) digits is 24, while the sum is 19.
Adding to 112112311110121 its reverse (121011113211211), we get a palindrome (233123424321332).
The spelling of 112112311110121 in words is "one hundred twelve trillion, one hundred twelve billion, three hundred eleven million, one hundred ten thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •