Base | Representation |
---|---|
bin | 10011100011011… |
… | …01001111101101 |
3 | 102102122100110001 |
4 | 21301231033231 |
5 | 313442302300 |
6 | 24135344301 |
7 | 4031122642 |
oct | 1161551755 |
9 | 372570401 |
10 | 164025325 |
11 | 84651722 |
12 | 46b22091 |
13 | 27c9ca09 |
14 | 17ad9dc9 |
15 | e60016a |
hex | 9c6d3ed |
164025325 has 6 divisors (see below), whose sum is σ = 203391434. Its totient is φ = 131220240.
The previous prime is 164025319. The next prime is 164025331. The reversal of 164025325 is 523520461.
It is an interprime number because it is at equal distance from previous prime (164025319) and next prime (164025331).
It can be written as a sum of positive squares in 3 ways, for example, as 24147396 + 139877929 = 4914^2 + 11827^2 .
It is not a de Polignac number, because 164025325 - 23 = 164025317 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 164025293 and 164025302.
It is a congruent number.
It is an unprimeable number.
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 5 ways as a sum of consecutive naturals, for example, 3280482 + ... + 3280531.
Almost surely, 2164025325 is an apocalyptic number.
It is an amenable number.
164025325 is a deficient number, since it is larger than the sum of its proper divisors (39366109).
164025325 is an equidigital number, since it uses as much as digits as its factorization.
164025325 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6561023 (or 6561018 counting only the distinct ones).
The product of its (nonzero) digits is 7200, while the sum is 28.
The square root of 164025325 is about 12807.2372118268. The cubic root of 164025325 is about 547.3985411406.
Adding to 164025325 its reverse (523520461), we get a palindrome (687545786).
The spelling of 164025325 in words is "one hundred sixty-four million, twenty-five thousand, three hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •