Base | Representation |
---|---|
bin | 10011100101001… |
… | …00001100011101 |
3 | 102110001210012001 |
4 | 21302210030131 |
5 | 314022003042 |
6 | 24144242301 |
7 | 4033051063 |
oct | 1162441435 |
9 | 373053161 |
10 | 164250397 |
11 | 84795833 |
12 | 47010391 |
13 | 2804b2ac |
14 | 17b58033 |
15 | e646bb7 |
hex | 9ca431d |
164250397 has 2 divisors, whose sum is σ = 164250398. Its totient is φ = 164250396.
The previous prime is 164250377. The next prime is 164250407. The reversal of 164250397 is 793052461.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 125574436 + 38675961 = 11206^2 + 6219^2 .
It is an emirp because it is prime and its reverse (793052461) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 164250397 - 215 = 164217629 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (164250347) 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, 82125198 + 82125199.
It is an arithmetic number, because the mean of its divisors is an integer number (82125199).
Almost surely, 2164250397 is an apocalyptic number.
It is an amenable number.
164250397 is a deficient number, since it is larger than the sum of its proper divisors (1).
164250397 is an equidigital number, since it uses as much as digits as its factorization.
164250397 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 45360, while the sum is 37.
The square root of 164250397 is about 12816.0211064121. The cubic root of 164250397 is about 547.6488028501.
It can be divided in two parts, 16425039 and 7, that added together give a triangular number (16425046 = T5731).
The spelling of 164250397 in words is "one hundred sixty-four million, two hundred fifty thousand, three hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •