Base | Representation |
---|---|
bin | 11101101100010011011101… |
… | …111011110111001000000000 |
3 | 122010101002012220202020022100 |
4 | 131230103131323313020000 |
5 | 114104023014213441413 |
6 | 1141423131322510400 |
7 | 36335444060623065 |
oct | 3554233573671000 |
9 | 563332186666270 |
10 | 130587909124608 |
11 | 38678026310121 |
12 | 1279098a665400 |
13 | 57b35052b0650 |
14 | 24366ba72ac6c |
15 | 1016d57be4a73 |
hex | 76c4ddef7200 |
130587909124608 has 240 divisors, whose sum is σ = 418969547732736. Its totient is φ = 38884736655360.
The previous prime is 130587909124601. The next prime is 130587909124609. The reversal of 130587909124608 is 806421909785031.
130587909124608 is a `hidden beast` number, since 1 + 3 + 0 + 5 + 8 + 7 + 9 + 0 + 9 + 12 + 4 + 608 = 666.
It is not an unprimeable number, because it can be changed into a prime (130587909124601) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 33303510 + ... + 37017557.
It is a 1-persistent number, because it is pandigital, but 2⋅130587909124608 = 261175818249216 is not.
Almost surely, 2130587909124608 is an apocalyptic number.
130587909124608 is a gapful number since it is divisible by the number (18) formed by its first and last digit.
It is an amenable number.
130587909124608 is an abundant number, since it is smaller than the sum of its proper divisors (288381638608128).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
130587909124608 is a wasteful number, since it uses less digits than its factorization.
130587909124608 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 70321135 (or 70321116 counting only the distinct ones).
The product of its (nonzero) digits is 26127360, while the sum is 63.
The spelling of 130587909124608 in words is "one hundred thirty trillion, five hundred eighty-seven billion, nine hundred nine million, one hundred twenty-four thousand, six hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •