Base | Representation |
---|---|
bin | 1111110011111… |
… | …11000010110111 |
3 | 100020120212011211 |
4 | 13321333002313 |
5 | 232424002301 |
6 | 21054542251 |
7 | 3200300212 |
oct | 771770267 |
9 | 306525154 |
10 | 132640951 |
11 | 68966123 |
12 | 38507987 |
13 | 21631891 |
14 | 1388a779 |
15 | b9a1051 |
hex | 7e7f0b7 |
132640951 has 2 divisors, whose sum is σ = 132640952. Its totient is φ = 132640950.
The previous prime is 132640903. The next prime is 132640961. The reversal of 132640951 is 159046231.
It is a strong prime.
It is an emirp because it is prime and its reverse (159046231) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-132640951 is a prime.
It is equal to p7519423 and since 132640951 and 7519423 have the same sum of digits, it is a Honaker prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (132640961) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 66320475 + 66320476.
It is an arithmetic number, because the mean of its divisors is an integer number (66320476).
Almost surely, 2132640951 is an apocalyptic number.
132640951 is a deficient number, since it is larger than the sum of its proper divisors (1).
132640951 is an equidigital number, since it uses as much as digits as its factorization.
132640951 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 132640951 is about 11516.9853260304. The cubic root of 132640951 is about 509.9871212947.
The spelling of 132640951 in words is "one hundred thirty-two million, six hundred forty thousand, nine hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •