Base | Representation |
---|---|
bin | 1100110010000101010000… |
… | …0000001010000110110001 |
3 | 1211202121020012220220002021 |
4 | 3030201110000022012301 |
5 | 3320232200313220144 |
6 | 45520322334151441 |
7 | 2650256442413650 |
oct | 314412400120661 |
9 | 54677205826067 |
10 | 14054542320049 |
11 | 4529552813a50 |
12 | 16aba45952581 |
13 | 7ac450a96cca |
14 | 36835a163197 |
15 | 1958ce440884 |
hex | cc85400a1b1 |
14054542320049 has 8 divisors (see below), whose sum is σ = 17522546269248. Its totient is φ = 10951591418160.
The previous prime is 14054542320041. The next prime is 14054542320059. The reversal of 14054542320049 is 94002324545041.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 14054542320049 - 23 = 14054542320041 is a prime.
It is a super-3 number, since 3×140545423200493 (a number of 40 digits) contains 333 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 14054542319987 and 14054542320014.
It is not an unprimeable number, because it can be changed into a prime (14054542320041) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 91263261742 + ... + 91263261895.
It is an arithmetic number, because the mean of its divisors is an integer number (2190318283656).
Almost surely, 214054542320049 is an apocalyptic number.
It is an amenable number.
14054542320049 is a deficient number, since it is larger than the sum of its proper divisors (3468003949199).
14054542320049 is a wasteful number, since it uses less digits than its factorization.
14054542320049 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 182526523655.
The product of its (nonzero) digits is 691200, while the sum is 43.
The spelling of 14054542320049 in words is "fourteen trillion, fifty-four billion, five hundred forty-two million, three hundred twenty thousand, forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •