Base | Representation |
---|---|
bin | 10011100110010… |
… | …00110010001110 |
3 | 102110100101202220 |
4 | 21303020302032 |
5 | 314041302040 |
6 | 24151400210 |
7 | 4034244036 |
oct | 1163106216 |
9 | 373311686 |
10 | 164400270 |
11 | 848883a1 |
12 | 47083066 |
13 | 280a1588 |
14 | 17b968c6 |
15 | e6762d0 |
hex | 9cc8c8e |
164400270 has 16 divisors (see below), whose sum is σ = 394560720. Its totient is φ = 43840064.
The previous prime is 164400263. The next prime is 164400277. The reversal of 164400270 is 72004461.
It is an interprime number because it is at equal distance from previous prime (164400263) and next prime (164400277).
It is a self number, because there is not a number n which added to its sum of digits gives 164400270.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (164400277) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2739975 + ... + 2740034.
It is an arithmetic number, because the mean of its divisors is an integer number (24660045).
Almost surely, 2164400270 is an apocalyptic number.
164400270 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
164400270 is an abundant number, since it is smaller than the sum of its proper divisors (230160450).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
164400270 is a wasteful number, since it uses less digits than its factorization.
164400270 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5480019.
The product of its (nonzero) digits is 1344, while the sum is 24.
The square root of 164400270 is about 12821.8668687520. The cubic root of 164400270 is about 547.8153226247.
The spelling of 164400270 in words is "one hundred sixty-four million, four hundred thousand, two hundred seventy".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •