Base | Representation |
---|---|
bin | 1111101111101… |
… | …11001100010001 |
3 | 100012112120212102 |
4 | 13313313030101 |
5 | 232303200442 |
6 | 21035010145 |
7 | 3162461666 |
oct | 767671421 |
9 | 305476772 |
10 | 132084497 |
11 | 68616046 |
12 | 38299955 |
13 | 2149850c |
14 | 13783a6d |
15 | b8e1232 |
hex | 7df7311 |
132084497 has 2 divisors, whose sum is σ = 132084498. Its totient is φ = 132084496.
The previous prime is 132084479. The next prime is 132084517. The reversal of 132084497 is 794480231.
Together with previous prime (132084479) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 131239936 + 844561 = 11456^2 + 919^2 .
It is a cyclic number.
It is not a de Polignac number, because 132084497 - 216 = 132018961 is a prime.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 132084497.
It is not a weakly prime, because it can be changed into another prime (132084697) 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, 66042248 + 66042249.
It is an arithmetic number, because the mean of its divisors is an integer number (66042249).
Almost surely, 2132084497 is an apocalyptic number.
It is an amenable number.
132084497 is a deficient number, since it is larger than the sum of its proper divisors (1).
132084497 is an equidigital number, since it uses as much as digits as its factorization.
132084497 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 48384, while the sum is 38.
The square root of 132084497 is about 11492.8019647082. The cubic root of 132084497 is about 509.2729573755.
The spelling of 132084497 in words is "one hundred thirty-two million, eighty-four thousand, four hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •