Base | Representation |
---|---|
bin | 11001011111100011111000… |
… | …110101010100000011001111 |
3 | 112200222120022122111001220111 |
4 | 121133203320311110003033 |
5 | 104143433230230120421 |
6 | 1034243114543100451 |
7 | 32421255101046250 |
oct | 3137437065240317 |
9 | 480876278431814 |
10 | 112120001020111 |
11 | 327a7909682567 |
12 | 106a97355a1727 |
13 | 4a73b41cb92b6 |
14 | 1d988cbd20b27 |
15 | ce67727e7ee1 |
hex | 65f8f8d540cf |
112120001020111 has 16 divisors (see below), whose sum is σ = 135368140034560. Its totient is φ = 90716131193760.
The previous prime is 112120001020099. The next prime is 112120001020121. The reversal of 112120001020111 is 111020100021211.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 112120001020111 - 221 = 112119998922959 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 112120001020091 and 112120001020100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (112120001020121) 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, 1521637395 + ... + 1521711076.
It is an arithmetic number, because the mean of its divisors is an integer number (8460508752160).
Almost surely, 2112120001020111 is an apocalyptic number.
112120001020111 is a deficient number, since it is larger than the sum of its proper divisors (23248139014449).
112120001020111 is a wasteful number, since it uses less digits than its factorization.
112120001020111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3043348774.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 112120001020111 its reverse (111020100021211), we get a palindrome (223140101041322).
The spelling of 112120001020111 in words is "one hundred twelve trillion, one hundred twenty billion, one million, twenty thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •