Base | Representation |
---|---|
bin | 11110001010010111010110… |
… | …011110011001101001010101 |
3 | 122101200120021212112202110111 |
4 | 132022113112132121221111 |
5 | 114341344200241334144 |
6 | 1150044130202323021 |
7 | 36640624303042666 |
oct | 3612272636315125 |
9 | 571616255482414 |
10 | 132653663230549 |
11 | 392a411468aa1a |
12 | 12a652034b9471 |
13 | 59032574350c6 |
14 | 24a8685d5136d |
15 | 105095d68a534 |
hex | 78a5d6799a55 |
132653663230549 has 2 divisors, whose sum is σ = 132653663230550. Its totient is φ = 132653663230548.
The previous prime is 132653663230537. The next prime is 132653663230597. The reversal of 132653663230549 is 945032366356231.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 85198345787025 + 47455317443524 = 9230295^2 + 6888782^2 .
It is a cyclic number.
It is not a de Polignac number, because 132653663230549 - 219 = 132653662706261 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 132653663230493 and 132653663230502.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (132653663231549) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 66326831615274 + 66326831615275.
It is an arithmetic number, because the mean of its divisors is an integer number (66326831615275).
Almost surely, 2132653663230549 is an apocalyptic number.
It is an amenable number.
132653663230549 is a deficient number, since it is larger than the sum of its proper divisors (1).
132653663230549 is an equidigital number, since it uses as much as digits as its factorization.
132653663230549 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 62985600, while the sum is 58.
The spelling of 132653663230549 in words is "one hundred thirty-two trillion, six hundred fifty-three billion, six hundred sixty-three million, two hundred thirty thousand, five hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.143 sec. • engine limits •