Base | Representation |
---|---|
bin | 1110101000101001101110… |
… | …1011101001000100000000 |
3 | 2002222100010102221020001122 |
4 | 3222022123223221010000 |
5 | 4102121003201242210 |
6 | 54120205455451412 |
7 | 3250401562044002 |
oct | 352123353510400 |
9 | 62870112836048 |
10 | 16091559399680 |
11 | 5144434858626 |
12 | 197a79a826b68 |
13 | 8c95733c949b |
14 | 3d8b9ad82372 |
15 | 1cd8a20d6b55 |
hex | ea29bae9100 |
16091559399680 has 144 divisors (see below), whose sum is σ = 39836818011648. Its totient is φ = 6221297664000.
The previous prime is 16091559399611. The next prime is 16091559399701. The reversal of 16091559399680 is 8699395519061.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 31930460 + ... + 32430500.
Almost surely, 216091559399680 is an apocalyptic number.
16091559399680 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 16091559399680, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (19918409005824).
16091559399680 is an abundant number, since it is smaller than the sum of its proper divisors (23745258611968).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
16091559399680 is an equidigital number, since it uses as much as digits as its factorization.
16091559399680 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 500904 (or 500890 counting only the distinct ones).
The product of its (nonzero) digits is 141717600, while the sum is 71.
The spelling of 16091559399680 in words is "sixteen trillion, ninety-one billion, five hundred fifty-nine million, three hundred ninety-nine thousand, six hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •