Base | Representation |
---|---|
bin | 10011100011101… |
… | …10010000010101 |
3 | 102102201020001212 |
4 | 21301312100111 |
5 | 313444442404 |
6 | 24140231205 |
7 | 4031335352 |
oct | 1161662025 |
9 | 372636055 |
10 | 164062229 |
11 | 84677421 |
12 | 46b3b505 |
13 | 27cb3756 |
14 | 17b09629 |
15 | e60b06e |
hex | 9c76415 |
164062229 has 2 divisors, whose sum is σ = 164062230. Its totient is φ = 164062228.
The previous prime is 164062177. The next prime is 164062231. The reversal of 164062229 is 922260461.
164062229 is nontrivially palindromic in base 15.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 142253329 + 21808900 = 11927^2 + 4670^2 .
It is a cyclic number.
It is not a de Polignac number, because 164062229 - 28 = 164061973 is a prime.
Together with 164062231, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 164062195 and 164062204.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (164062429) 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, 82031114 + 82031115.
It is an arithmetic number, because the mean of its divisors is an integer number (82031115).
Almost surely, 2164062229 is an apocalyptic number.
It is an amenable number.
164062229 is a deficient number, since it is larger than the sum of its proper divisors (1).
164062229 is an equidigital number, since it uses as much as digits as its factorization.
164062229 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 10368, while the sum is 32.
The square root of 164062229 is about 12808.6778786883. The cubic root of 164062229 is about 547.4395910637.
The spelling of 164062229 in words is "one hundred sixty-four million, sixty-two thousand, two hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •