Base | Representation |
---|---|
bin | 11110000010100010101000… |
… | …001110101111001011100001 |
3 | 122022210011112100021222100211 |
4 | 132002202220032233023201 |
5 | 114304042100203214023 |
6 | 1144553132102214121 |
7 | 36554032022643301 |
oct | 3602425016571341 |
9 | 568704470258324 |
10 | 132116016460513 |
11 | 391070a7041a38 |
12 | 12998b76724341 |
13 | 5894643926557 |
14 | 248a640cc7601 |
15 | 1041992958a0d |
hex | 7828a83af2e1 |
132116016460513 has 2 divisors, whose sum is σ = 132116016460514. Its totient is φ = 132116016460512.
The previous prime is 132116016460403. The next prime is 132116016460553. The reversal of 132116016460513 is 315064610611231.
It is a happy number.
It is an a-pointer prime, because the next prime (132116016460553) can be obtained adding 132116016460513 to its sum of digits (40).
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 128057129310289 + 4058887150224 = 11316233^2 + 2014668^2 .
It is a cyclic number.
It is not a de Polignac number, because 132116016460513 - 237 = 131978577507041 is a prime.
It is not a weakly prime, because it can be changed into another prime (132116016460553) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 66058008230256 + 66058008230257.
It is an arithmetic number, because the mean of its divisors is an integer number (66058008230257).
Almost surely, 2132116016460513 is an apocalyptic number.
It is an amenable number.
132116016460513 is a deficient number, since it is larger than the sum of its proper divisors (1).
132116016460513 is an equidigital number, since it uses as much as digits as its factorization.
132116016460513 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 77760, while the sum is 40.
The spelling of 132116016460513 in words is "one hundred thirty-two trillion, one hundred sixteen billion, sixteen million, four hundred sixty thousand, five hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •