Base | Representation |
---|---|
bin | 1111101111111… |
… | …00101011000111 |
3 | 100012120201200001 |
4 | 13313330223013 |
5 | 232304410301 |
6 | 21035302131 |
7 | 3162614314 |
oct | 767745307 |
9 | 305521601 |
10 | 132106951 |
11 | 686309a9 |
12 | 382aa947 |
13 | 214a57c2 |
14 | 1378bd0b |
15 | b8e7c01 |
hex | 7dfcac7 |
132106951 has 2 divisors, whose sum is σ = 132106952. Its totient is φ = 132106950.
The previous prime is 132106939. The next prime is 132106957. The reversal of 132106951 is 159601231.
It is a strong prime.
It is an emirp because it is prime and its reverse (159601231) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 132106951 - 27 = 132106823 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (132106957) 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, 66053475 + 66053476.
It is an arithmetic number, because the mean of its divisors is an integer number (66053476).
Almost surely, 2132106951 is an apocalyptic number.
132106951 is a deficient number, since it is larger than the sum of its proper divisors (1).
132106951 is an equidigital number, since it uses as much as digits as its factorization.
132106951 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1620, while the sum is 28.
The square root of 132106951 is about 11493.7787955050. The cubic root of 132106951 is about 509.3018140729.
The spelling of 132106951 in words is "one hundred thirty-two million, one hundred six thousand, nine hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •