Base | Representation |
---|---|
bin | 11111011110010001… |
… | …00011101100101000 |
3 | 1121121120111110010200 |
4 | 33233020203230220 |
5 | 234101101244010 |
6 | 11432355112200 |
7 | 1135502164530 |
oct | 175710435450 |
9 | 47546443120 |
10 | 16896899880 |
11 | 719094aa73 |
12 | 33368a2660 |
13 | 1793835813 |
14 | b641224c0 |
15 | 68d60dcc0 |
hex | 3ef223b28 |
16896899880 has 768 divisors, whose sum is σ = 70177536000. Its totient is φ = 3438360576.
The previous prime is 16896899863. The next prime is 16896899893. The reversal of 16896899880 is 8899869861.
It is a Harshad number since it is a multiple of its sum of digits (72).
It is a junction number, because it is equal to n+sod(n) for n = 16896899799 and 16896899808.
It is an unprimeable number.
It is a polite number, since it can be written in 191 ways as a sum of consecutive naturals, for example, 59706219 + ... + 59706501.
It is an arithmetic number, because the mean of its divisors is an integer number (91377000).
Almost surely, 216896899880 is an apocalyptic number.
16896899880 is a gapful number since it is divisible by the number (10) 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 16896899880, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (35088768000).
16896899880 is an abundant number, since it is smaller than the sum of its proper divisors (53280636120).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
16896899880 is a wasteful number, since it uses less digits than its factorization.
16896899880 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 398 (or 391 counting only the distinct ones).
The product of its (nonzero) digits is 107495424, while the sum is 72.
The spelling of 16896899880 in words is "sixteen billion, eight hundred ninety-six million, eight hundred ninety-nine thousand, eight hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •