Base | Representation |
---|---|
bin | 11001010011110100011011… |
… | …101101011101001001001001 |
3 | 112121010102122120122202112022 |
4 | 121103310123231131021021 |
5 | 104042223243332423423 |
6 | 1032424314054254225 |
7 | 32306052121143455 |
oct | 3123643355351111 |
9 | 477112576582468 |
10 | 111313132311113 |
11 | 325166a8298067 |
12 | 10599292957375 |
13 | 4a15a24cb4c95 |
14 | 1d6b827657665 |
15 | cd079b4c2dc8 |
hex | 653d1bb5d249 |
111313132311113 has 32 divisors (see below), whose sum is σ = 121290811084800. Its totient is φ = 101836632744000.
The previous prime is 111313132311107. The next prime is 111313132311151. The reversal of 111313132311113 is 311113231313111.
It is a cyclic number.
It is not a de Polignac number, because 111313132311113 - 216 = 111313132245577 is a prime.
It is a super-2 number, since 2×1113131323111132 (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 (111313132311163) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 34618118 + ... + 37696688.
It is an arithmetic number, because the mean of its divisors is an integer number (3790337846400).
Almost surely, 2111313132311113 is an apocalyptic number.
It is an amenable number.
111313132311113 is a deficient number, since it is larger than the sum of its proper divisors (9977678773687).
111313132311113 is a wasteful number, since it uses less digits than its factorization.
111313132311113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3079133.
The product of its digits is 486, while the sum is 26.
Adding to 111313132311113 its reverse (311113231313111), we get a palindrome (422426363624224).
The spelling of 111313132311113 in words is "one hundred eleven trillion, three hundred thirteen billion, one hundred thirty-two million, three hundred eleven thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •