Base | Representation |
---|---|
bin | 1110111101000101100010… |
… | …0111010010100011100000 |
3 | 2011012220021120012220020222 |
4 | 3233101120213102203200 |
5 | 4123343442101104322 |
6 | 54545345215022212 |
7 | 3314640326512325 |
oct | 357213047224340 |
9 | 64186246186228 |
10 | 16442621503712 |
11 | 526a3051a93a8 |
12 | 1a1683480a968 |
13 | 9236c003a821 |
14 | 40bb818cab4c |
15 | 1d7a9c4d7e42 |
hex | ef4589d28e0 |
16442621503712 has 96 divisors (see below), whose sum is σ = 33817462668864. Its totient is φ = 7861896806400.
The previous prime is 16442621503673. The next prime is 16442621503729. The reversal of 16442621503712 is 21730512624461.
It is a super-3 number, since 3×164426215037123 (a number of 41 digits) contains 333 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 94020512 + ... + 94195232.
It is an arithmetic number, because the mean of its divisors is an integer number (352265236134).
Almost surely, 216442621503712 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 16442621503712, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (16908731334432).
16442621503712 is an abundant number, since it is smaller than the sum of its proper divisors (17374841165152).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
16442621503712 is a wasteful number, since it uses less digits than its factorization.
16442621503712 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 176132 (or 176124 counting only the distinct ones).
The product of its (nonzero) digits is 483840, while the sum is 44.
The spelling of 16442621503712 in words is "sixteen trillion, four hundred forty-two billion, six hundred twenty-one million, five hundred three thousand, seven hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •