Base | Representation |
---|---|
bin | 11110110101010010… |
… | …01001100100100000 |
3 | 1120201121121201122120 |
4 | 33122221021210200 |
5 | 232400044401310 |
6 | 11334314504240 |
7 | 1124126134065 |
oct | 173251114440 |
9 | 46647551576 |
10 | 16553122080 |
11 | 7024895690 |
12 | 325b735080 |
13 | 173a54a7c1 |
14 | b305d4c6c |
15 | 66d353b70 |
hex | 3daa49920 |
16553122080 has 384 divisors, whose sum is σ = 61284335616. Its totient is φ = 3713740800.
The previous prime is 16553122043. The next prime is 16553122087. The reversal of 16553122080 is 8022135561.
It is a Harshad number since it is a multiple of its sum of digits (33).
It is not an unprimeable number, because it can be changed into a prime (16553122087) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 3762442 + ... + 3766838.
It is an arithmetic number, because the mean of its divisors is an integer number (159594624).
Almost surely, 216553122080 is an apocalyptic number.
16553122080 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 16553122080, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (30642167808).
16553122080 is an abundant number, since it is smaller than the sum of its proper divisors (44731213536).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
16553122080 is a wasteful number, since it uses less digits than its factorization.
16553122080 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4480 (or 4472 counting only the distinct ones).
The product of its (nonzero) digits is 14400, while the sum is 33.
The spelling of 16553122080 in words is "sixteen billion, five hundred fifty-three million, one hundred twenty-two thousand, eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.032 sec. • engine limits •