Base | Representation |
---|---|
bin | 1111110000010… |
… | …10000000111101 |
3 | 100012200111121222 |
4 | 13320022000331 |
5 | 232313132342 |
6 | 21040403125 |
7 | 3163232531 |
oct | 770120075 |
9 | 305614558 |
10 | 132161597 |
11 | 68668a67 |
12 | 383164a5 |
13 | 214c4639 |
14 | 137a3bc1 |
15 | b908ed2 |
hex | 7e0a03d |
132161597 has 2 divisors, whose sum is σ = 132161598. Its totient is φ = 132161596.
The previous prime is 132161591. The next prime is 132161639. The reversal of 132161597 is 795161231.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 114361636 + 17799961 = 10694^2 + 4219^2 .
It is a cyclic number.
It is not a de Polignac number, because 132161597 - 210 = 132160573 is a prime.
It is a Chen prime.
It is equal to p7493813 and since 132161597 and 7493813 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 (132161591) 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, 66080798 + 66080799.
It is an arithmetic number, because the mean of its divisors is an integer number (66080799).
Almost surely, 2132161597 is an apocalyptic number.
It is an amenable number.
132161597 is a deficient number, since it is larger than the sum of its proper divisors (1).
132161597 is an equidigital number, since it uses as much as digits as its factorization.
132161597 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 11340, while the sum is 35.
The square root of 132161597 is about 11496.1557487710. The cubic root of 132161597 is about 509.3720285724.
The spelling of 132161597 in words is "one hundred thirty-two million, one hundred sixty-one thousand, five hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •