Base | Representation |
---|---|
bin | 1001101100101000110… |
… | …0110100100101100000 |
3 | 120221000201101120210201 |
4 | 2123022030310211200 |
5 | 10212144341203000 |
6 | 204311400034544 |
7 | 15015350056234 |
oct | 2331214644540 |
9 | 527021346721 |
10 | 166601116000 |
11 | 64722a94330 |
12 | 28356462a54 |
13 | 12930a32217 |
14 | 80c64ba5c4 |
15 | 450126396a |
hex | 26ca334960 |
166601116000 has 192 divisors, whose sum is σ = 450984905280. Its totient is φ = 59980800000.
The previous prime is 166601115959. The next prime is 166601116013. The reversal of 166601116000 is 611106661.
It is a self number, because there is not a number n which added to its sum of digits gives 166601116000.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 4425256 + ... + 4462744.
It is an arithmetic number, because the mean of its divisors is an integer number (2348879715).
Almost surely, 2166601116000 is an apocalyptic number.
166601116000 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 166601116000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (225492452640).
166601116000 is an abundant number, since it is smaller than the sum of its proper divisors (284383789280).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
166601116000 is a wasteful number, since it uses less digits than its factorization.
166601116000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 37626 (or 37608 counting only the distinct ones).
The product of its (nonzero) digits is 1296, while the sum is 28.
The spelling of 166601116000 in words is "one hundred sixty-six billion, six hundred one million, one hundred sixteen thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •