Base | Representation |
---|---|
bin | 11110000001010100110110… |
… | …111011001001100001111011 |
3 | 122022111011222201021020021011 |
4 | 132001110312323021201323 |
5 | 114301210040321342111 |
6 | 1144450522005054351 |
7 | 36545014465164436 |
oct | 3601246673114173 |
9 | 568434881236234 |
10 | 132032511121531 |
11 | 390847454a1899 |
12 | 129849509b73b7 |
13 | 58897c6505c77 |
14 | 248659c7a081d |
15 | 103e706876021 |
hex | 781536ec987b |
132032511121531 has 2 divisors, whose sum is σ = 132032511121532. Its totient is φ = 132032511121530.
The previous prime is 132032511121463. The next prime is 132032511121559. The reversal of 132032511121531 is 135121115230231.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 132032511121531 - 229 = 132031974250619 is a prime.
It is a super-2 number, since 2×1320325111215312 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 132032511121493 and 132032511121502.
It is not a weakly prime, because it can be changed into another prime (132032511101531) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 66016255560765 + 66016255560766.
It is an arithmetic number, because the mean of its divisors is an integer number (66016255560766).
Almost surely, 2132032511121531 is an apocalyptic number.
132032511121531 is a deficient number, since it is larger than the sum of its proper divisors (1).
132032511121531 is an equidigital number, since it uses as much as digits as its factorization.
132032511121531 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5400, while the sum is 31.
Adding to 132032511121531 its reverse (135121115230231), we get a palindrome (267153626351762).
The spelling of 132032511121531 in words is "one hundred thirty-two trillion, thirty-two billion, five hundred eleven million, one hundred twenty-one thousand, five hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.099 sec. • engine limits •