Base | Representation |
---|---|
bin | 11001101100110101010000… |
… | …111111010101111011011000 |
3 | 112211012202101100010121001222 |
4 | 121230311100333111323120 |
5 | 104303404030324023000 |
6 | 1040222105011231212 |
7 | 32544202440652034 |
oct | 3154652077257330 |
9 | 484182340117058 |
10 | 113032013111000 |
11 | 33019675731aa5 |
12 | 108164405a8508 |
13 | 4b0bb47281399 |
14 | 1dcaac87911c4 |
15 | d1034e682a85 |
hex | 66cd50fd5ed8 |
113032013111000 has 32 divisors (see below), whose sum is σ = 264494910682080. Its totient is φ = 45212805244000.
The previous prime is 113032013110949. The next prime is 113032013111029. The reversal of 113032013111000 is 111310230311.
It is a self number, because there is not a number n which added to its sum of digits gives 113032013111000.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 56516005556 + ... + 56516007555.
It is an arithmetic number, because the mean of its divisors is an integer number (8265465958815).
Almost surely, 2113032013111000 is an apocalyptic number.
113032013111000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
113032013111000 is an abundant number, since it is smaller than the sum of its proper divisors (151462897571080).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
113032013111000 is a wasteful number, since it uses less digits than its factorization.
113032013111000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 113032013132 (or 113032013118 counting only the distinct ones).
The product of its (nonzero) digits is 54, while the sum is 17.
Adding to 113032013111000 its reverse (111310230311), we get a palindrome (113143323341311).
The spelling of 113032013111000 in words is "one hundred thirteen trillion, thirty-two billion, thirteen million, one hundred eleven thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •