Base | Representation |
---|---|
bin | 1001100110011010000… |
… | …1100001011100000000 |
3 | 120202201011200012022120 |
4 | 2121212201201130000 |
5 | 10200233234232432 |
6 | 203433421004240 |
7 | 14626042563465 |
oct | 2314641413400 |
9 | 522634605276 |
10 | 164928820992 |
11 | 63a45024341 |
12 | 27b6a3b3680 |
13 | 12725436150 |
14 | 7da836766c |
15 | 4454533c2c |
hex | 2666861700 |
164928820992 has 288 divisors, whose sum is σ = 494478985728. Its totient is φ = 48422043648.
The previous prime is 164928820907. The next prime is 164928820993. The reversal of 164928820992 is 299028829461.
It is a super-2 number, since 2×1649288209922 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (164928820993) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 147652818 + ... + 147653934.
Almost surely, 2164928820992 is an apocalyptic number.
164928820992 is a gapful number since it is divisible by the number (12) 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 164928820992, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (247239492864).
164928820992 is an abundant number, since it is smaller than the sum of its proper divisors (329550164736).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
164928820992 is a wasteful number, since it uses less digits than its factorization.
164928820992 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1815 (or 1801 counting only the distinct ones).
The product of its (nonzero) digits is 8957952, while the sum is 60.
The spelling of 164928820992 in words is "one hundred sixty-four billion, nine hundred twenty-eight million, eight hundred twenty thousand, nine hundred ninety-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •