Base | Representation |
---|---|
bin | 11001101101000100010000… |
… | …000000100000010110000110 |
3 | 112211021021220122122202100120 |
4 | 121231010100000200112012 |
5 | 104304140003302002313 |
6 | 1040233325332322410 |
7 | 32545312241530053 |
oct | 3155042000402606 |
9 | 484237818582316 |
10 | 113048102765958 |
11 | 330254819429a8 |
12 | 10819590a73406 |
13 | 4b1050c798489 |
14 | 1dcb7b35c002a |
15 | d10991e87d23 |
hex | 66d110020586 |
113048102765958 has 16 divisors (see below), whose sum is σ = 228291314324736. Its totient is φ = 37316849456520.
The previous prime is 113048102765957. The next prime is 113048102765959. The reversal of 113048102765958 is 859567201840311.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (113048102765957) and next prime (113048102765959).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (113048102765957) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 91462865698 + ... + 91462866933.
It is an arithmetic number, because the mean of its divisors is an integer number (14268207145296).
It is a 1-persistent number, because it is pandigital, but 2⋅113048102765958 = 226096205531916 is not.
Almost surely, 2113048102765958 is an apocalyptic number.
113048102765958 is an abundant number, since it is smaller than the sum of its proper divisors (115243211558778).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
113048102765958 is a wasteful number, since it uses less digits than its factorization.
113048102765958 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 182925732739.
The product of its (nonzero) digits is 14515200, while the sum is 60.
The spelling of 113048102765958 in words is "one hundred thirteen trillion, forty-eight billion, one hundred two million, seven hundred sixty-five thousand, nine hundred fifty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.096 sec. • engine limits •