Base | Representation |
---|---|
bin | 10011100011011… |
… | …01000011001001 |
3 | 102102122022100021 |
4 | 21301231003021 |
5 | 313442241041 |
6 | 24135340441 |
7 | 4031120413 |
oct | 1161550311 |
9 | 372568307 |
10 | 164024521 |
11 | 84651061 |
12 | 46b21721 |
13 | 27c9c53b |
14 | 17ad99b3 |
15 | e5eecd1 |
hex | 9c6d0c9 |
164024521 has 2 divisors, whose sum is σ = 164024522. Its totient is φ = 164024520.
The previous prime is 164024519. The next prime is 164024527. The reversal of 164024521 is 125420461.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 162282121 + 1742400 = 12739^2 + 1320^2 .
It is an emirp because it is prime and its reverse (125420461) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 164024521 - 21 = 164024519 is a prime.
Together with 164024519, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (164024527) 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, 82012260 + 82012261.
It is an arithmetic number, because the mean of its divisors is an integer number (82012261).
Almost surely, 2164024521 is an apocalyptic number.
It is an amenable number.
164024521 is a deficient number, since it is larger than the sum of its proper divisors (1).
164024521 is an equidigital number, since it uses as much as digits as its factorization.
164024521 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1920, while the sum is 25.
The square root of 164024521 is about 12807.2058232856. The cubic root of 164024521 is about 547.3976467479.
Adding to 164024521 its reverse (125420461), we get a palindrome (289444982).
The spelling of 164024521 in words is "one hundred sixty-four million, twenty-four thousand, five hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •