Base | Representation |
---|---|
bin | 11110111011101010100101… |
… | …000110011010011001010000 |
3 | 122211200110001111122121102221 |
4 | 132323222211012122121100 |
5 | 120312401110344230440 |
6 | 1201200344242550424 |
7 | 40440451530645133 |
oct | 3673524506323120 |
9 | 584613044577387 |
10 | 136041564055120 |
11 | 3a38a9a3349459 |
12 | 13311924668414 |
13 | 5aba883a26429 |
14 | 258463817421a |
15 | 10adb474b6d4a |
hex | 7bbaa519a650 |
136041564055120 has 80 divisors (see below), whose sum is σ = 316943794656000. Its totient is φ = 54305295754752.
The previous prime is 136041564055109. The next prime is 136041564055127. The reversal of 136041564055120 is 21550465140631.
It is a tau number, because it is divible by the number of its divisors (80).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (136041564055127) 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, 1206445782 + ... + 1206558538.
It is an arithmetic number, because the mean of its divisors is an integer number (3961797433200).
Almost surely, 2136041564055120 is an apocalyptic number.
136041564055120 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
136041564055120 is an abundant number, since it is smaller than the sum of its proper divisors (180902230600880).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
136041564055120 is a wasteful number, since it uses less digits than its factorization.
136041564055120 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 143492 (or 143486 counting only the distinct ones).
The product of its (nonzero) digits is 432000, while the sum is 43.
The spelling of 136041564055120 in words is "one hundred thirty-six trillion, forty-one billion, five hundred sixty-four million, fifty-five thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •