Base | Representation |
---|---|
bin | 11001011101111110011001… |
… | …000111111100111100111101 |
3 | 112200121011000122120002022012 |
4 | 121131332121013330330331 |
5 | 104140142032401023401 |
6 | 1034121052553301005 |
7 | 32410346344105100 |
oct | 3135763107747475 |
9 | 480534018502265 |
10 | 112011021111101 |
11 | 32765675328962 |
12 | 106905a0404765 |
13 | 4a66794c42238 |
14 | 1d935103d8737 |
15 | ce39e504e8bb |
hex | 65df991fcf3d |
112011021111101 has 48 divisors (see below), whose sum is σ = 137082825956160. Its totient is φ = 91168469280000.
The previous prime is 112011021111083. The next prime is 112011021111127. The reversal of 112011021111101 is 101111120110211.
It is not a de Polignac number, because 112011021111101 - 210 = 112011021110077 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (112011021111131) 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 47 ways as a sum of consecutive naturals, for example, 7293446 + ... + 16649816.
It is an arithmetic number, because the mean of its divisors is an integer number (2855892207420).
Almost surely, 2112011021111101 is an apocalyptic number.
It is an amenable number.
112011021111101 is a deficient number, since it is larger than the sum of its proper divisors (25071804845059).
112011021111101 is a wasteful number, since it uses less digits than its factorization.
112011021111101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9356586 (or 9356579 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 14.
Adding to 112011021111101 its reverse (101111120110211), we get a palindrome (213122141221312).
The spelling of 112011021111101 in words is "one hundred twelve trillion, eleven billion, twenty-one million, one hundred eleven thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •