Base | Representation |
---|---|
bin | 1101000010000000010100… |
… | …0100100101000010110000 |
3 | 1212201202022122101221110210 |
4 | 3100200011010211002300 |
5 | 3334222420033021330 |
6 | 50250123022424120 |
7 | 3006112401253200 |
oct | 320400504450260 |
9 | 55652278357423 |
10 | 14328095985840 |
11 | 462456971899a |
12 | 1734a6a432040 |
13 | 7cc197839c40 |
14 | 3776aabc8400 |
15 | 19ca8ee838b0 |
hex | d08051250b0 |
14328095985840 has 1920 divisors, whose sum is σ = 58105842988032. Its totient is φ = 2893409648640.
The previous prime is 14328095985839. The next prime is 14328095985869. The reversal of 14328095985840 is 4858959082341.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 383 ways as a sum of consecutive naturals, for example, 82821363994 + ... + 82821364166.
Almost surely, 214328095985840 is an apocalyptic number.
14328095985840 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 14328095985840, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (29052921494016).
14328095985840 is an abundant number, since it is smaller than the sum of its proper divisors (43777747002192).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14328095985840 is a wasteful number, since it uses less digits than its factorization.
14328095985840 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 467 (or 454 counting only the distinct ones).
The product of its (nonzero) digits is 99532800, while the sum is 66.
The spelling of 14328095985840 in words is "fourteen trillion, three hundred twenty-eight billion, ninety-five million, nine hundred eighty-five thousand, eight hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •