Base | Representation |
---|---|
bin | 1001100101001100111… |
… | …0011000001001011100 |
3 | 120201212121102011120111 |
4 | 2121103032120021130 |
5 | 10144102342110400 |
6 | 203341333055404 |
7 | 14615031466342 |
oct | 2312316301134 |
9 | 521777364514 |
10 | 164605035100 |
11 | 638992841a0 |
12 | 27a99a87564 |
13 | 126a332a96c |
14 | 7d77361992 |
15 | 4435dc73ba |
hex | 265339825c |
164605035100 has 144 divisors (see below), whose sum is σ = 410466228480. Its totient is φ = 56665612800.
The previous prime is 164605035079. The next prime is 164605035163. The reversal of 164605035100 is 1530506461.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 56700249 + ... + 56703151.
It is an arithmetic number, because the mean of its divisors is an integer number (2850459920).
Almost surely, 2164605035100 is an apocalyptic number.
164605035100 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 164605035100, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (205233114240).
164605035100 is an abundant number, since it is smaller than the sum of its proper divisors (245861193380).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
164605035100 is a wasteful number, since it uses less digits than its factorization.
164605035100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5660 (or 5653 counting only the distinct ones).
The product of its (nonzero) digits is 10800, while the sum is 31.
The spelling of 164605035100 in words is "one hundred sixty-four billion, six hundred five million, thirty-five thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.456 sec. • engine limits •