Base | Representation |
---|---|
bin | 10011100110000… |
… | …01100001100000 |
3 | 102110021212222100 |
4 | 21303001201200 |
5 | 314034324103 |
6 | 24151010400 |
7 | 4034061240 |
oct | 1163014140 |
9 | 373255870 |
10 | 164370528 |
11 | 84868013 |
12 | 47069a00 |
13 | 28090b8a |
14 | 17b89b20 |
15 | e66c5a3 |
hex | 9cc1860 |
164370528 has 72 divisors (see below), whose sum is σ = 534210768. Its totient is φ = 46962432.
The previous prime is 164370499. The next prime is 164370551. The reversal of 164370528 is 825073461.
164370528 is a `hidden beast` number, since 1 + 64 + 3 + 70 + 528 = 666.
It is a tau number, because it is divible by the number of its divisors (72).
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a junction number, because it is equal to n+sod(n) for n = 164370492 and 164370501.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 38751 + ... + 42782.
It is an arithmetic number, because the mean of its divisors is an integer number (7419594).
Almost surely, 2164370528 is an apocalyptic number.
164370528 is a gapful number since it is divisible by the number (18) formed by its first and last digit.
It is an amenable number.
164370528 is an abundant number, since it is smaller than the sum of its proper divisors (369840240).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
164370528 is a wasteful number, since it uses less digits than its factorization.
164370528 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 81556 (or 81545 counting only the distinct ones).
The product of its (nonzero) digits is 40320, while the sum is 36.
The square root of 164370528 is about 12820.7070007859. The cubic root of 164370528 is about 547.7822851567.
The spelling of 164370528 in words is "one hundred sixty-four million, three hundred seventy thousand, five hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •