Base | Representation |
---|---|
bin | 10011100111100… |
… | …11111011110101 |
3 | 102110200101012221 |
4 | 21303303323311 |
5 | 314112431023 |
6 | 24155242341 |
7 | 4035611236 |
oct | 1163637365 |
9 | 373611187 |
10 | 164577013 |
11 | 84999167 |
12 | 471493b1 |
13 | 28133b63 |
14 | 17c0108d |
15 | e6ad85d |
hex | 9cf3ef5 |
164577013 has 2 divisors, whose sum is σ = 164577014. Its totient is φ = 164577012.
The previous prime is 164577011. The next prime is 164577037. The reversal of 164577013 is 310775461.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 89529444 + 75047569 = 9462^2 + 8663^2 .
It is an emirp because it is prime and its reverse (310775461) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 164577013 - 21 = 164577011 is a prime.
Together with 164577011, it forms a pair of twin primes.
It is a self number, because there is not a number n which added to its sum of digits gives 164577013.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (164577011) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 82288506 + 82288507.
It is an arithmetic number, because the mean of its divisors is an integer number (82288507).
Almost surely, 2164577013 is an apocalyptic number.
It is an amenable number.
164577013 is a deficient number, since it is larger than the sum of its proper divisors (1).
164577013 is an equidigital number, since it uses as much as digits as its factorization.
164577013 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 17640, while the sum is 34.
The square root of 164577013 is about 12828.7572663918. The cubic root of 164577013 is about 548.0115669233.
The spelling of 164577013 in words is "one hundred sixty-four million, five hundred seventy-seven thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •