Base | Representation |
---|---|
bin | 10011101010000… |
… | …01010110110010 |
3 | 102111021111020000 |
4 | 21311001112302 |
5 | 314203103010 |
6 | 24210130430 |
7 | 4041401622 |
oct | 1165012662 |
9 | 374244200 |
10 | 164894130 |
11 | 85095445 |
12 | 47280a16 |
13 | 282152bb |
14 | 17c84882 |
15 | e7227c0 |
hex | 9d415b2 |
164894130 has 160 divisors (see below), whose sum is σ = 474211584. Its totient is φ = 41019264.
The previous prime is 164894129. The next prime is 164894137. The reversal of 164894130 is 31498461.
164894130 is a `hidden beast` number, since 1 + 648 + 9 + 4 + 1 + 3 + 0 = 666.
It is not an unprimeable number, because it can be changed into a prime (164894137) 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 79 ways as a sum of consecutive naturals, for example, 987307 + ... + 987473.
Almost surely, 2164894130 is an apocalyptic number.
164894130 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 164894130, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (237105792).
164894130 is an abundant number, since it is smaller than the sum of its proper divisors (309317454).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
164894130 is a wasteful number, since it uses less digits than its factorization.
164894130 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 262 (or 253 counting only the distinct ones).
The product of its (nonzero) digits is 20736, while the sum is 36.
The square root of 164894130 is about 12841.1109332487. The cubic root of 164894130 is about 548.3633217668.
The spelling of 164894130 in words is "one hundred sixty-four million, eight hundred ninety-four thousand, one hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •