Base | Representation |
---|---|
bin | 11001100101110111010000… |
… | …011000001111000000100101 |
3 | 112202111222021000222101111002 |
4 | 121211313100120033000211 |
5 | 104223032234141134131 |
6 | 1035214104201323045 |
7 | 32464460042506346 |
oct | 3145672030170045 |
9 | 482458230871432 |
10 | 112553114005541 |
11 | 32954564669a20 |
12 | 1075966a196485 |
13 | 4aa5936913131 |
14 | 1db1857b460cd |
15 | d02b7127b6cb |
hex | 665dd060f025 |
112553114005541 has 16 divisors (see below), whose sum is σ = 124925472460800. Its totient is φ = 100539108188400.
The previous prime is 112553114005537. The next prime is 112553114005543. The reversal of 112553114005541 is 145500411355211.
It is a cyclic number.
It is not a de Polignac number, because 112553114005541 - 22 = 112553114005537 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 112553114005495 and 112553114005504.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (112553114005543) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 39706571 + ... + 42446648.
It is an arithmetic number, because the mean of its divisors is an integer number (7807842028800).
Almost surely, 2112553114005541 is an apocalyptic number.
112553114005541 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
112553114005541 is a deficient number, since it is larger than the sum of its proper divisors (12372358455259).
112553114005541 is a wasteful number, since it uses less digits than its factorization.
112553114005541 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 82155400.
The product of its (nonzero) digits is 60000, while the sum is 38.
The spelling of 112553114005541 in words is "one hundred twelve trillion, five hundred fifty-three billion, one hundred fourteen million, five thousand, five hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •