Base | Representation |
---|---|
bin | 111111101111011100… |
… | …1011101110101110000 |
3 | 111002022122121222102102 |
4 | 1333132321131311300 |
5 | 4220314144430220 |
6 | 142514454235532 |
7 | 12614050224221 |
oct | 1773671356560 |
9 | 432278558372 |
10 | 136883592560 |
11 | 53063246100 |
12 | 22642055ba8 |
13 | cba6040b20 |
14 | 68a77a3248 |
15 | 3862336775 |
hex | 1fdee5dd70 |
136883592560 has 240 divisors, whose sum is σ = 388889276160. Its totient is φ = 44463513600.
The previous prime is 136883592557. The next prime is 136883592617. The reversal of 136883592560 is 65295388631.
It is a junction number, because it is equal to n+sod(n) for n = 136883592496 and 136883592505.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 3883496 + ... + 3918584.
It is an arithmetic number, because the mean of its divisors is an integer number (1620371984).
Almost surely, 2136883592560 is an apocalyptic number.
136883592560 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 136883592560, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (194444638080).
136883592560 is an abundant number, since it is smaller than the sum of its proper divisors (252005683600).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
136883592560 is a wasteful number, since it uses less digits than its factorization.
136883592560 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 35168 (or 35151 counting only the distinct ones).
The product of its (nonzero) digits is 9331200, while the sum is 56.
The spelling of 136883592560 in words is "one hundred thirty-six billion, eight hundred eighty-three million, five hundred ninety-two thousand, five hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •