Base | Representation |
---|---|
bin | 11001001111010000110011… |
… | …110000010110110010110001 |
3 | 112120000111102001211022121120 |
4 | 121033100303300112302301 |
5 | 104022111001244041423 |
6 | 1032024410353012453 |
7 | 32244325360650033 |
oct | 3117206360266261 |
9 | 476014361738546 |
10 | 111000003112113 |
11 | 32405922aa1285 |
12 | 10548664554129 |
13 | 49c23420b968b |
14 | 1d5a600957c53 |
15 | cc7571390ee3 |
hex | 64f433c16cb1 |
111000003112113 has 16 divisors (see below), whose sum is σ = 154538923822080. Its totient is φ = 70734881275344.
The previous prime is 111000003112099. The next prime is 111000003112129. The reversal of 111000003112113 is 311211300000111.
It is not a de Polignac number, because 111000003112113 - 212 = 111000003108017 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 111000003112092 and 111000003112101.
It is not an unprimeable number, because it can be changed into a prime (111000003112013) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 542276533 + ... + 542481186.
It is an arithmetic number, because the mean of its divisors is an integer number (9658682738880).
Almost surely, 2111000003112113 is an apocalyptic number.
It is an amenable number.
111000003112113 is a deficient number, since it is larger than the sum of its proper divisors (43538920709967).
111000003112113 is a wasteful number, since it uses less digits than its factorization.
111000003112113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1084759228.
The product of its (nonzero) digits is 18, while the sum is 15.
Adding to 111000003112113 its reverse (311211300000111), we get a palindrome (422211303112224).
The spelling of 111000003112113 in words is "one hundred eleven trillion, three million, one hundred twelve thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •