Base | Representation |
---|---|
bin | 111111000101… |
… | …101100000000 |
3 | 1011010020101011 |
4 | 333011230000 |
5 | 13213211433 |
6 | 1350250304 |
7 | 260400550 |
oct | 77055400 |
9 | 34106334 |
10 | 16538368 |
11 | 9376580 |
12 | 5656994 |
13 | 3570922 |
14 | 22a7160 |
15 | 16ba3cd |
hex | fc5b00 |
16538368 has 72 divisors (see below), whose sum is σ = 41207040. Its totient is φ = 6435840.
The previous prime is 16538351. The next prime is 16538377. The reversal of 16538368 is 86383561.
It is a super-2 number, since 2×165383682 = 547035232206848, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 16538368.
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, 19293 + ... + 20131.
It is an arithmetic number, because the mean of its divisors is an integer number (572320).
Almost surely, 216538368 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 16538368, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (20603520).
16538368 is an abundant number, since it is smaller than the sum of its proper divisors (24668672).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
16538368 is an equidigital number, since it uses as much as digits as its factorization.
16538368 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 873 (or 859 counting only the distinct ones).
The product of its digits is 103680, while the sum is 40.
The square root of 16538368 is about 4066.7392343252. The cubic root of 16538368 is about 254.7793451955.
The spelling of 16538368 in words is "sixteen million, five hundred thirty-eight thousand, three hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •