Base | Representation |
---|---|
bin | 111101010000… |
… | …100111010000 |
3 | 1010012212120120 |
4 | 331100213100 |
5 | 13102340312 |
6 | 1332110240 |
7 | 253332516 |
oct | 75204720 |
9 | 33185516 |
10 | 16058832 |
11 | 9079269 |
12 | 5465380 |
13 | 343358a |
14 | 21c04b6 |
15 | 162328c |
hex | f509d0 |
16058832 has 40 divisors (see below), whose sum is σ = 42062784. Its totient is φ = 5278464.
The previous prime is 16058831. The next prime is 16058843. The reversal of 16058832 is 23885061.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 16058793 and 16058802.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (16058831) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1213 + ... + 5795.
Almost surely, 216058832 is an apocalyptic number.
16058832 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 16058832, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (21031392).
16058832 is an abundant number, since it is smaller than the sum of its proper divisors (26003952).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
16058832 is a wasteful number, since it uses less digits than its factorization.
16058832 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4667 (or 4661 counting only the distinct ones).
The product of its (nonzero) digits is 11520, while the sum is 33.
The square root of 16058832 is about 4007.3472522356. The cubic root of 16058832 is about 252.2926808516.
The spelling of 16058832 in words is "sixteen million, fifty-eight thousand, eight hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.094 sec. • engine limits •