Base | Representation |
---|---|
bin | 1101001011110111111011… |
… | …1000110010010110000000 |
3 | 1220022221221200211222201002 |
4 | 3102331332320302112000 |
5 | 3400012133210030423 |
6 | 50500043033031132 |
7 | 3024264055655216 |
oct | 322757670622600 |
9 | 56287850758632 |
10 | 14497643439488 |
11 | 468a463850310 |
12 | 17618a75554a8 |
13 | 812177ab5301 |
14 | 3819926dccb6 |
15 | 1a21b4bdb228 |
hex | d2f7ee32580 |
14497643439488 has 384 divisors, whose sum is σ = 35021457354240. Its totient is φ = 5916213248000.
The previous prime is 14497643439463. The next prime is 14497643439491. The reversal of 14497643439488 is 88493434679441.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 3752947445 + ... + 3752951307.
It is an arithmetic number, because the mean of its divisors is an integer number (91201711860).
Almost surely, 214497643439488 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 14497643439488, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (17510728677120).
14497643439488 is an abundant number, since it is smaller than the sum of its proper divisors (20523813914752).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14497643439488 is a wasteful number, since it uses less digits than its factorization.
14497643439488 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4346 (or 4317 counting only the distinct ones).
The product of its digits is 2006581248, while the sum is 74.
The spelling of 14497643439488 in words is "fourteen trillion, four hundred ninety-seven billion, six hundred forty-three million, four hundred thirty-nine thousand, four hundred eighty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •