Base | Representation |
---|---|
bin | 11001101100100011110001… |
… | …100100010001101011100011 |
3 | 112211010221220110202002211012 |
4 | 121230203301210101223203 |
5 | 104303102044432423021 |
6 | 1040205321233411135 |
7 | 32542636151541104 |
oct | 3154436144215343 |
9 | 484127813662735 |
10 | 113013232311011 |
11 | 33011708432a9a |
12 | 1081287aa09aab |
13 | 4b0a143361196 |
14 | 1dc9c263963ab |
15 | d0eb0099635b |
hex | 66c8f1911ae3 |
113013232311011 has 8 divisors (see below), whose sum is σ = 113429096787504. Its totient is φ = 112597424485920.
The previous prime is 113013232310999. The next prime is 113013232311019. The reversal of 113013232311011 is 110113232310311.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-113013232311011 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (113013232311019) 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 7 ways as a sum of consecutive naturals, for example, 10163660 + ... + 18147353.
It is an arithmetic number, because the mean of its divisors is an integer number (14178637098438).
Almost surely, 2113013232311011 is an apocalyptic number.
113013232311011 is a deficient number, since it is larger than the sum of its proper divisors (415864476493).
113013232311011 is a wasteful number, since it uses less digits than its factorization.
113013232311011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 28325701.
The product of its (nonzero) digits is 324, while the sum is 23.
Adding to 113013232311011 its reverse (110113232310311), we get a palindrome (223126464621322).
The spelling of 113013232311011 in words is "one hundred thirteen trillion, thirteen billion, two hundred thirty-two million, three hundred eleven thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •