Base | Representation |
---|---|
bin | 10011100011011… |
… | …01010110010101 |
3 | 102102122101000202 |
4 | 21301231112111 |
5 | 313442310444 |
6 | 24135350245 |
7 | 4031124116 |
oct | 1161552625 |
9 | 372571022 |
10 | 164025749 |
11 | 84651a78 |
12 | 46b22385 |
13 | 27c9cc74 |
14 | 17ada20d |
15 | e60034e |
hex | 9c6d595 |
164025749 has 6 divisors (see below), whose sum is σ = 165644406. Its totient is φ = 162422760.
The previous prime is 164025737. The next prime is 164025761. The reversal of 164025749 is 947520461.
It is an interprime number because it is at equal distance from previous prime (164025737) and next prime (164025761).
It can be written as a sum of positive squares in only one way, i.e., 119202724 + 44823025 = 10918^2 + 6695^2 .
It is not a de Polignac number, because 164025749 - 212 = 164021653 is a prime.
It is a super-2 number, since 2×1640257492 = 53808892670022002, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (164025049) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 2879 + ... + 18339.
It is an arithmetic number, because the mean of its divisors is an integer number (27607401).
Almost surely, 2164025749 is an apocalyptic number.
It is an amenable number.
164025749 is a deficient number, since it is larger than the sum of its proper divisors (1618657).
164025749 is an equidigital number, since it uses as much as digits as its factorization.
164025749 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15667 (or 15564 counting only the distinct ones).
The product of its (nonzero) digits is 60480, while the sum is 38.
The square root of 164025749 is about 12807.2537649568. The cubic root of 164025749 is about 547.3990128092.
The spelling of 164025749 in words is "one hundred sixty-four million, twenty-five thousand, seven hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •