Base | Representation |
---|---|
bin | 1001100100110110011… |
… | …0000110010011111001 |
3 | 120201122000200212112021 |
4 | 2121031212012103321 |
5 | 10143404202341301 |
6 | 203324120514441 |
7 | 14612503641646 |
oct | 2311546062371 |
9 | 521560625467 |
10 | 164510590201 |
11 | 6384aa37361 |
12 | 27a7231ba21 |
13 | 126898b07c9 |
14 | 7d689b8dcd |
15 | 442c96d8a1 |
hex | 264d9864f9 |
164510590201 has 2 divisors, whose sum is σ = 164510590202. Its totient is φ = 164510590200.
The previous prime is 164510590199. The next prime is 164510590241. The reversal of 164510590201 is 102095015461.
It is a happy number.
164510590201 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 140793050176 + 23717540025 = 375224^2 + 154005^2 .
It is a cyclic number.
It is not a de Polignac number, because 164510590201 - 21 = 164510590199 is a prime.
Together with 164510590199, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (164510590241) 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, 82255295100 + 82255295101.
It is an arithmetic number, because the mean of its divisors is an integer number (82255295101).
Almost surely, 2164510590201 is an apocalyptic number.
It is an amenable number.
164510590201 is a deficient number, since it is larger than the sum of its proper divisors (1).
164510590201 is an equidigital number, since it uses as much as digits as its factorization.
164510590201 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 10800, while the sum is 34.
The spelling of 164510590201 in words is "one hundred sixty-four billion, five hundred ten million, five hundred ninety thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •