Base | Representation |
---|---|
bin | 11001011111011011100000… |
… | …010101111111010110101101 |
3 | 112200221201002100220002212012 |
4 | 121133123200111333112231 |
5 | 104143311312024033401 |
6 | 1034235025452451005 |
7 | 32420516045366600 |
oct | 3137334025772655 |
9 | 480851070802765 |
10 | 112111000221101 |
11 | 327a400a995aa2 |
12 | 106a7a43179a65 |
13 | 4a7303931941b |
14 | 1d982b677c337 |
15 | ce63e750e8bb |
hex | 65f6e057f5ad |
112111000221101 has 12 divisors (see below), whose sum is σ = 130425482930400. Its totient is φ = 96087298671000.
The previous prime is 112111000221097. The next prime is 112111000221173. The reversal of 112111000221101 is 101122000111211.
It is not a de Polignac number, because 112111000221101 - 22 = 112111000221097 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (112111000227101) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 92779001 + ... + 93979598.
It is an arithmetic number, because the mean of its divisors is an integer number (10868790244200).
Almost surely, 2112111000221101 is an apocalyptic number.
It is an amenable number.
112111000221101 is a deficient number, since it is larger than the sum of its proper divisors (18314482709299).
112111000221101 is a wasteful number, since it uses less digits than its factorization.
112111000221101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 186770864 (or 186770857 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 14.
Adding to 112111000221101 its reverse (101122000111211), we get a palindrome (213233000332312).
The spelling of 112111000221101 in words is "one hundred twelve trillion, one hundred eleven billion, two hundred twenty-one thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •