Base | Representation |
---|---|
bin | 111110111110… |
… | …001111100000 |
3 | 1011001200112200 |
4 | 332332033200 |
5 | 13211222442 |
6 | 1345453200 |
7 | 260212623 |
oct | 76761740 |
9 | 34050480 |
10 | 16507872 |
11 | 9355677 |
12 | 5641200 |
13 | 355ca94 |
14 | 2299dba |
15 | 16b134c |
hex | fbe3e0 |
16507872 has 108 divisors (see below), whose sum is σ = 49611744. Its totient is φ = 5201280.
The previous prime is 16507837. The next prime is 16507889. The reversal of 16507872 is 27870561.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is an alternating number because its digits alternate between odd and even.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 17 ways as a sum of consecutive naturals, for example, 383883 + ... + 383925.
It is an arithmetic number, because the mean of its divisors is an integer number (459368).
Almost surely, 216507872 is an apocalyptic number.
16507872 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 16507872, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (24805872).
16507872 is an abundant number, since it is smaller than the sum of its proper divisors (33103872).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
16507872 is a wasteful number, since it uses less digits than its factorization.
16507872 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 133 (or 79 counting only the distinct ones).
The product of its (nonzero) digits is 23520, while the sum is 36.
The square root of 16507872 is about 4062.9880629901. The cubic root of 16507872 is about 254.6226483255.
The spelling of 16507872 in words is "sixteen million, five hundred seven thousand, eight hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •