Base | Representation |
---|---|
bin | 111111010101… |
… | …001101100000 |
3 | 1011020110121010 |
4 | 333111031200 |
5 | 13222230302 |
6 | 1351500520 |
7 | 261054123 |
oct | 77251540 |
9 | 34213533 |
10 | 16601952 |
11 | 940a324 |
12 | 5687740 |
13 | 3593853 |
14 | 22c23ba |
15 | 16ce16c |
hex | fd5360 |
16601952 has 96 divisors (see below), whose sum is σ = 46545408. Its totient is φ = 5170176.
The previous prime is 16601947. The next prime is 16601969. The reversal of 16601952 is 25910661.
It is a tau number, because it is divible by the number of its divisors (96).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 161133 + ... + 161235.
It is an arithmetic number, because the mean of its divisors is an integer number (484848).
Almost surely, 216601952 is an apocalyptic number.
16601952 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 16601952, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (23272704).
16601952 is an abundant number, since it is smaller than the sum of its proper divisors (29943456).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
16601952 is a wasteful number, since it uses less digits than its factorization.
16601952 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 212 (or 204 counting only the distinct ones).
The product of its (nonzero) digits is 3240, while the sum is 30.
The square root of 16601952 is about 4074.5493002294. The cubic root of 16601952 is about 255.1054389032.
The spelling of 16601952 in words is "sixteen million, six hundred one thousand, nine hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.361 sec. • engine limits •