Base | Representation |
---|---|
bin | 1111110100000… |
… | …01001000011101 |
3 | 100020121021220111 |
4 | 13322001020131 |
5 | 232424241001 |
6 | 21055050021 |
7 | 3200334145 |
oct | 772011035 |
9 | 306537814 |
10 | 132649501 |
11 | 68971596 |
12 | 38510911 |
13 | 2163573a |
14 | 1388d925 |
15 | b9a3851 |
hex | 7e8121d |
132649501 has 2 divisors, whose sum is σ = 132649502. Its totient is φ = 132649500.
The previous prime is 132649459. The next prime is 132649519. The reversal of 132649501 is 105946231.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 132227001 + 422500 = 11499^2 + 650^2 .
It is an emirp because it is prime and its reverse (105946231) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 132649501 - 27 = 132649373 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (132649571) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 66324750 + 66324751.
It is an arithmetic number, because the mean of its divisors is an integer number (66324751).
Almost surely, 2132649501 is an apocalyptic number.
It is an amenable number.
132649501 is a deficient number, since it is larger than the sum of its proper divisors (1).
132649501 is an equidigital number, since it uses as much as digits as its factorization.
132649501 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6480, while the sum is 31.
The square root of 132649501 is about 11517.3565109360. The cubic root of 132649501 is about 509.9980789368.
The spelling of 132649501 in words is "one hundred thirty-two million, six hundred forty-nine thousand, five hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •