Base | Representation |
---|---|
bin | 1111001001110000110010… |
… | …0100000000110110010000 |
3 | 2011222201101011000021001001 |
4 | 3302130030210000312100 |
5 | 4140430434030032212 |
6 | 55233402122151344 |
7 | 3336446653066153 |
oct | 362341444006620 |
9 | 64881334007031 |
10 | 16660388908432 |
11 | 53436a4226755 |
12 | 1a50a8a652554 |
13 | 93b0b632c919 |
14 | 41851d56dc9a |
15 | 1dd5956bd657 |
hex | f270c900d90 |
16660388908432 has 160 divisors (see below), whose sum is σ = 35179997066240. Its totient is φ = 7622190720000.
The previous prime is 16660388908399. The next prime is 16660388908447. The reversal of 16660388908432 is 23480988306661.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 5551610932 + ... + 5551613932.
It is an arithmetic number, because the mean of its divisors is an integer number (219874981664).
Almost surely, 216660388908432 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 16660388908432, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (17589998533120).
16660388908432 is an abundant number, since it is smaller than the sum of its proper divisors (18519608157808).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
16660388908432 is an equidigital number, since it uses as much as digits as its factorization.
16660388908432 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3734 (or 3666 counting only the distinct ones).
The product of its (nonzero) digits is 71663616, while the sum is 64.
The spelling of 16660388908432 in words is "sixteen trillion, six hundred sixty billion, three hundred eighty-eight million, nine hundred eight thousand, four hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •