Base | Representation |
---|---|
bin | 11110000101011000001110… |
… | …100010110010101100010011 |
3 | 122100110210211112111102101211 |
4 | 132011120032202302230103 |
5 | 114320240420132202011 |
6 | 1145222500504040551 |
7 | 36604104041061043 |
oct | 3605301642625423 |
9 | 570423745442354 |
10 | 132311006522131 |
11 | 39181867928298 |
12 | 12a0a914463157 |
13 | 58a9b4a017338 |
14 | 2495c5b87b723 |
15 | 1046aa6161b21 |
hex | 78560e8b2b13 |
132311006522131 has 2 divisors, whose sum is σ = 132311006522132. Its totient is φ = 132311006522130.
The previous prime is 132311006522083. The next prime is 132311006522209. The reversal of 132311006522131 is 131225600113231.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 132311006522131 - 27 = 132311006522003 is a prime.
It is a super-2 number, since 2×1323110065221312 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 132311006522093 and 132311006522102.
It is not a weakly prime, because it can be changed into another prime (132311006502131) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 66155503261065 + 66155503261066.
It is an arithmetic number, because the mean of its divisors is an integer number (66155503261066).
Almost surely, 2132311006522131 is an apocalyptic number.
132311006522131 is a deficient number, since it is larger than the sum of its proper divisors (1).
132311006522131 is an equidigital number, since it uses as much as digits as its factorization.
132311006522131 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 6480, while the sum is 31.
Adding to 132311006522131 its reverse (131225600113231), we get a palindrome (263536606635362).
The spelling of 132311006522131 in words is "one hundred thirty-two trillion, three hundred eleven billion, six million, five hundred twenty-two thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •