Base | Representation |
---|---|
bin | 111101010101… |
… | …000101100000 |
3 | 1010020210201002 |
4 | 331111011200 |
5 | 13103432102 |
6 | 1332331132 |
7 | 253440110 |
oct | 75250540 |
9 | 33223632 |
10 | 16077152 |
11 | 9091003 |
12 | 5473aa8 |
13 | 343ba10 |
14 | 21c7040 |
15 | 1628902 |
hex | f55160 |
16077152 has 48 divisors (see below), whose sum is σ = 38963232. Its totient is φ = 6359040.
The previous prime is 16077143. The next prime is 16077163. The reversal of 16077152 is 25177061.
It is a super-2 number, since 2×160771522 = 516949632862208, which contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
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, 152 + ... + 5672.
It is an arithmetic number, because the mean of its divisors is an integer number (811734).
Almost surely, 216077152 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 16077152, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (19481616).
16077152 is an abundant number, since it is smaller than the sum of its proper divisors (22886080).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
16077152 is a wasteful number, since it uses less digits than its factorization.
16077152 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5551 (or 5543 counting only the distinct ones).
The product of its (nonzero) digits is 2940, while the sum is 29.
The square root of 16077152 is about 4009.6324021037. The cubic root of 16077152 is about 252.3885833312.
Subtracting 16077152 from its reverse (25177061), we obtain a palindrome (9099909).
The spelling of 16077152 in words is "sixteen million, seventy-seven thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •