Base | Representation |
---|---|
bin | 1111110010000… |
… | …11100010100001 |
3 | 100020010110211122 |
4 | 13321003202201 |
5 | 232343202332 |
6 | 21045422025 |
7 | 3165233501 |
oct | 771034241 |
9 | 306113748 |
10 | 132397217 |
11 | 68809a97 |
12 | 3840a915 |
13 | 21577964 |
14 | 13825a01 |
15 | b953c12 |
hex | 7e438a1 |
132397217 has 2 divisors, whose sum is σ = 132397218. Its totient is φ = 132397216.
The previous prime is 132397183. The next prime is 132397219. The reversal of 132397217 is 712793231.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 92467456 + 39929761 = 9616^2 + 6319^2 .
It is an emirp because it is prime and its reverse (712793231) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 132397217 - 210 = 132396193 is a prime.
It is a super-3 number, since 3×1323972173 (a number of 25 digits) contains 333 as substring.
Together with 132397219, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (132397219) 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, 66198608 + 66198609.
It is an arithmetic number, because the mean of its divisors is an integer number (66198609).
Almost surely, 2132397217 is an apocalyptic number.
It is an amenable number.
132397217 is a deficient number, since it is larger than the sum of its proper divisors (1).
132397217 is an equidigital number, since it uses as much as digits as its factorization.
132397217 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 15876, while the sum is 35.
The square root of 132397217 is about 11506.3989588403. The cubic root of 132397217 is about 509.6745546392.
The spelling of 132397217 in words is "one hundred thirty-two million, three hundred ninety-seven thousand, two hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •