Base | Representation |
---|---|
bin | 11001110101001100010010… |
… | …010101011100101100000000 |
3 | 112220020200012110011020211010 |
4 | 121311030102111130230000 |
5 | 104342312041303341122 |
6 | 1041342033324320520 |
7 | 32633540445126615 |
oct | 3165142225345400 |
9 | 486220173136733 |
10 | 113606487558912 |
11 | 3322027156a4a7 |
12 | 108a98469a3140 |
13 | 4b510798449ca |
14 | 200a82496450c |
15 | d20273618e0c |
hex | 67531255cb00 |
113606487558912 has 108 divisors (see below), whose sum is σ = 307396902026760. Its totient is φ = 37248027770880.
The previous prime is 113606487558871. The next prime is 113606487558917. The reversal of 113606487558912 is 219855784606311.
It is a super-3 number, since 3×1136064875589123 (a number of 43 digits) contains 333 as substring.
It is not an unprimeable number, because it can be changed into a prime (113606487558917) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 17019337 + ... + 22734792.
It is a 1-persistent number, because it is pandigital, but 2⋅113606487558912 = 227212975117824 is not.
Almost surely, 2113606487558912 is an apocalyptic number.
113606487558912 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
113606487558912 is an abundant number, since it is smaller than the sum of its proper divisors (193790414467848).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
113606487558912 is an frugal number, since it uses more digits than its factorization.
113606487558912 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 39754270 (or 39754195 counting only the distinct ones).
The product of its (nonzero) digits is 87091200, while the sum is 66.
The spelling of 113606487558912 in words is "one hundred thirteen trillion, six hundred six billion, four hundred eighty-seven million, five hundred fifty-eight thousand, nine hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •