Base | Representation |
---|---|
bin | 1111110011010… |
… | …00101110011101 |
3 | 100020102012202222 |
4 | 13321220232131 |
5 | 232413041113 |
6 | 21052555125 |
7 | 3166436534 |
oct | 771505635 |
9 | 306365688 |
10 | 132549533 |
11 | 68903476 |
12 | 38482aa5 |
13 | 215cc09c |
14 | 1386531b |
15 | b983e08 |
hex | 7e68b9d |
132549533 has 2 divisors, whose sum is σ = 132549534. Its totient is φ = 132549532.
The previous prime is 132549511. The next prime is 132549539. The reversal of 132549533 is 335945231.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 124500964 + 8048569 = 11158^2 + 2837^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-132549533 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 132549493 and 132549502.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (132549539) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 66274766 + 66274767.
It is an arithmetic number, because the mean of its divisors is an integer number (66274767).
Almost surely, 2132549533 is an apocalyptic number.
It is an amenable number.
132549533 is a deficient number, since it is larger than the sum of its proper divisors (1).
132549533 is an equidigital number, since it uses as much as digits as its factorization.
132549533 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 48600, while the sum is 35.
The square root of 132549533 is about 11513.0158082059. The cubic root of 132549533 is about 509.8699309467.
The spelling of 132549533 in words is "one hundred thirty-two million, five hundred forty-nine thousand, five hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.094 sec. • engine limits •