Base | Representation |
---|---|
bin | 10011100101000… |
… | …00111000000000 |
3 | 102110001002112110 |
4 | 21302200320000 |
5 | 314021034200 |
6 | 24144055320 |
7 | 4032663330 |
oct | 1162407000 |
9 | 373032473 |
10 | 164236800 |
11 | 847865a2 |
12 | 47004540 |
13 | 28045050 |
14 | 17b530c0 |
15 | e642b50 |
hex | 9ca0e00 |
164236800 has 480 divisors, whose sum is σ = 681956352. Its totient is φ = 33914880.
The previous prime is 164236783. The next prime is 164236801. The reversal of 164236800 is 8632461.
It is a tau number, because it is divible by the number of its divisors (480).
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (164236801) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 3494377 + ... + 3494423.
Almost surely, 2164236800 is an apocalyptic number.
164236800 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 164236800, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (340978176).
164236800 is an abundant number, since it is smaller than the sum of its proper divisors (517719552).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
164236800 is a wasteful number, since it uses less digits than its factorization.
164236800 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 98 (or 77 counting only the distinct ones).
The product of its (nonzero) digits is 6912, while the sum is 30.
The square root of 164236800 is about 12815.4906265816. The cubic root of 164236800 is about 547.6336905857.
The spelling of 164236800 in words is "one hundred sixty-four million, two hundred thirty-six thousand, eight hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •