Base | Representation |
---|---|
bin | 1010000111000111101100… |
… | …1111101111111010111010 |
3 | 1110100211001201112201000120 |
4 | 2201301323033233322322 |
5 | 2424122010412304213 |
6 | 35351141032314110 |
7 | 2225131414024056 |
oct | 241617317577272 |
9 | 43324051481016 |
10 | 11117443088058 |
11 | 35a697687926a |
12 | 12b6775242936 |
13 | 6284a7973778 |
14 | 2a6131094c66 |
15 | 1442cbe41423 |
hex | a1c7b3efeba |
11117443088058 has 128 divisors (see below), whose sum is σ = 25234372039680. Its totient is φ = 3244126878720.
The previous prime is 11117443088051. The next prime is 11117443088069. The reversal of 11117443088058 is 85088034471111.
It is a super-3 number, since 3×111174430880583 (a number of 40 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Harshad number since it is a multiple of its sum of digits (51).
It is a self number, because there is not a number n which added to its sum of digits gives 11117443088058.
It is not an unprimeable number, because it can be changed into a prime (11117443088051) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 64579285 + ... + 64751207.
It is an arithmetic number, because the mean of its divisors is an integer number (197143531560).
Almost surely, 211117443088058 is an apocalyptic number.
11117443088058 is an abundant number, since it is smaller than the sum of its proper divisors (14116928951622).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11117443088058 is a wasteful number, since it uses less digits than its factorization.
11117443088058 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 172572.
The product of its (nonzero) digits is 860160, while the sum is 51.
The spelling of 11117443088058 in words is "eleven trillion, one hundred seventeen billion, four hundred forty-three million, eighty-eight thousand, fifty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •