Base | Representation |
---|---|
bin | 11110111011000010… |
… | …00010000010000000 |
3 | 1120211222022201120200 |
4 | 33131201002002000 |
5 | 232444414410241 |
6 | 11343200005200 |
7 | 1125252640314 |
oct | 173541020200 |
9 | 46758281520 |
10 | 16601325696 |
11 | 704a01978a |
12 | 3273900800 |
13 | 1747527357 |
14 | b36b81b44 |
15 | 6726c64b6 |
hex | 3dd842080 |
16601325696 has 192 divisors, whose sum is σ = 50617132800. Its totient is φ = 5208053760.
The previous prime is 16601325679. The next prime is 16601325709. The reversal of 16601325696 is 69652310661.
16601325696 is a `hidden beast` number, since 1 + 6 + 601 + 32 + 5 + 6 + 9 + 6 = 666.
It is a tau number, because it is divible by the number of its divisors (192).
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 3434001 + ... + 3438831.
It is an arithmetic number, because the mean of its divisors is an integer number (263630900).
Almost surely, 216601325696 is an apocalyptic number.
16601325696 is a gapful number since it is divisible by the number (16) 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 16601325696, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (25308566400).
16601325696 is an abundant number, since it is smaller than the sum of its proper divisors (34015807104).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
16601325696 is a wasteful number, since it uses less digits than its factorization.
16601325696 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5027 (or 5012 counting only the distinct ones).
The product of its (nonzero) digits is 349920, while the sum is 45.
The spelling of 16601325696 in words is "sixteen billion, six hundred one million, three hundred twenty-five thousand, six hundred ninety-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •