Base | Representation |
---|---|
bin | 10011100011100… |
… | …11110011101101 |
3 | 102102200201022121 |
4 | 21301303303231 |
5 | 313444132310 |
6 | 24140112541 |
7 | 4031264212 |
oct | 1161636355 |
9 | 372621277 |
10 | 164052205 |
11 | 8466a939 |
12 | 46b35751 |
13 | 27cac015 |
14 | 17b05b09 |
15 | e6080da |
hex | 9c73ced |
164052205 has 4 divisors (see below), whose sum is σ = 196862652. Its totient is φ = 131241760.
The previous prime is 164052173. The next prime is 164052209. The reversal of 164052205 is 502250461.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 116359369 + 47692836 = 10787^2 + 6906^2 .
It is not a de Polignac number, because 164052205 - 25 = 164052173 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 164052205.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (164052209) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 16405216 + ... + 16405225.
It is an arithmetic number, because the mean of its divisors is an integer number (49215663).
Almost surely, 2164052205 is an apocalyptic number.
It is an amenable number.
164052205 is a deficient number, since it is larger than the sum of its proper divisors (32810447).
164052205 is an equidigital number, since it uses as much as digits as its factorization.
164052205 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 32810446.
The product of its (nonzero) digits is 2400, while the sum is 25.
The square root of 164052205 is about 12808.2865754948. The cubic root of 164052205 is about 547.4284415418.
The spelling of 164052205 in words is "one hundred sixty-four million, fifty-two thousand, two hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •