Base | Representation |
---|---|
bin | 111101000111… |
… | …011111010000 |
3 | 1010010222022021 |
4 | 331013133100 |
5 | 13100141311 |
6 | 1331221224 |
7 | 253115533 |
oct | 75073720 |
9 | 33128267 |
10 | 16021456 |
11 | 9053180 |
12 | 5447814 |
13 | 341c569 |
14 | 21b0a1a |
15 | 1617171 |
hex | f477d0 |
16021456 has 80 divisors (see below), whose sum is σ = 36336960. Its totient is φ = 6773760.
The previous prime is 16021417. The next prime is 16021457. The reversal of 16021456 is 65412061.
It is a self number, because there is not a number n which added to its sum of digits gives 16021456.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (16021457) 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, 219436 + ... + 219508.
It is an arithmetic number, because the mean of its divisors is an integer number (454212).
Almost surely, 216021456 is an apocalyptic number.
16021456 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 16021456, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (18168480).
16021456 is an abundant number, since it is smaller than the sum of its proper divisors (20315504).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
16021456 is a wasteful number, since it uses less digits than its factorization.
16021456 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 164 (or 158 counting only the distinct ones).
The product of its (nonzero) digits is 1440, while the sum is 25.
The square root of 16021456 is about 4002.6811014619. The cubic root of 16021456 is about 252.0967966096.
The spelling of 16021456 in words is "sixteen million, twenty-one thousand, four hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •