Base | Representation |
---|---|
bin | 1100110001010011001111… |
… | …1110001111000000101101 |
3 | 1211201022120210112120111001 |
4 | 3030110303332033000231 |
5 | 3320022203212334203 |
6 | 45510222420200301 |
7 | 2646303021063025 |
oct | 314246376170055 |
9 | 54638523476431 |
10 | 14041120043053 |
11 | 4523895238644 |
12 | 16a931a839091 |
13 | 7ab0c208407c |
14 | 3678456b4a85 |
15 | 195395dc991d |
hex | cc533f8f02d |
14041120043053 has 8 divisors (see below), whose sum is σ = 14208061271040. Its totient is φ = 13875059772000.
The previous prime is 14041120043047. The next prime is 14041120043077. The reversal of 14041120043053 is 35034002114041.
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 14041120043053 - 233 = 14032530108461 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14041120043023) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 220207168 + ... + 220270921.
It is an arithmetic number, because the mean of its divisors is an integer number (1776007658880).
Almost surely, 214041120043053 is an apocalyptic number.
It is an amenable number.
14041120043053 is a deficient number, since it is larger than the sum of its proper divisors (166941227987).
14041120043053 is a wasteful number, since it uses less digits than its factorization.
14041120043053 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 440478467.
The product of its (nonzero) digits is 5760, while the sum is 28.
Adding to 14041120043053 its reverse (35034002114041), we get a palindrome (49075122157094).
The spelling of 14041120043053 in words is "fourteen trillion, forty-one billion, one hundred twenty million, forty-three thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •