Base | Representation |
---|---|
bin | 111110100110… |
… | …000101000000 |
3 | 1010212122202220 |
4 | 332212011000 |
5 | 13200041041 |
6 | 1343411040 |
7 | 256321230 |
oct | 76460500 |
9 | 33778686 |
10 | 16408896 |
11 | 9298279 |
12 | 55b3a80 |
13 | 3526a0a |
14 | 2271cc0 |
15 | 1691d66 |
hex | fa6140 |
16408896 has 112 divisors (see below), whose sum is σ = 51450240. Its totient is φ = 4515840.
The previous prime is 16408891. The next prime is 16408921. The reversal of 16408896 is 69880461.
16408896 = T216 + T217 + ... + T476.
It is a tau number, because it is divible by the number of its divisors (112).
It is a Harshad number since it is a multiple of its sum of digits (42).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (16408891) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 38766 + ... + 39186.
Almost surely, 216408896 is an apocalyptic number.
16408896 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 16408896, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (25725120).
16408896 is an abundant number, since it is smaller than the sum of its proper divisors (35041344).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
16408896 is a wasteful number, since it uses less digits than its factorization.
16408896 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 472 (or 462 counting only the distinct ones).
The product of its (nonzero) digits is 82944, while the sum is 42.
The square root of 16408896 is about 4050.7895526675. The cubic root of 16408896 is about 254.1127488364.
The spelling of 16408896 in words is "sixteen million, four hundred eight thousand, eight hundred ninety-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •