Base | Representation |
---|---|
bin | 11111000100100010… |
… | …00010101000000000 |
3 | 1121001112021121111000 |
4 | 33202101002220000 |
5 | 233130320114104 |
6 | 11355124052000 |
7 | 1130241221043 |
oct | 174221025000 |
9 | 47045247430 |
10 | 16681019904 |
11 | 709000116a |
12 | 3296534000 |
13 | 175abab4a3 |
14 | b435a8c5a |
15 | 6796b9639 |
hex | 3e2442a00 |
16681019904 has 320 divisors, whose sum is σ = 53277840000. Its totient is φ = 5135892480.
The previous prime is 16681019903. The next prime is 16681019917. The reversal of 16681019904 is 40991018661.
It is a self number, because there is not a number n which added to its sum of digits gives 16681019904.
It is not an unprimeable number, because it can be changed into a prime (16681019903) 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 31 ways as a sum of consecutive naturals, for example, 10768122 + ... + 10769670.
It is an arithmetic number, because the mean of its divisors is an integer number (166493250).
Almost surely, 216681019904 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 16681019904, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (26638920000).
16681019904 is an abundant number, since it is smaller than the sum of its proper divisors (36596820096).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
16681019904 is a wasteful number, since it uses less digits than its factorization.
16681019904 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1636 (or 1614 counting only the distinct ones).
The product of its (nonzero) digits is 93312, while the sum is 45.
The spelling of 16681019904 in words is "sixteen billion, six hundred eighty-one million, nineteen thousand, nine hundred four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •