Base | Representation |
---|---|
bin | 1010101111000111100100… |
… | …0100010100111110101101 |
3 | 1112210111201221222000221210 |
4 | 2223301321010110332231 |
5 | 3021401310413311203 |
6 | 41034543045545033 |
7 | 2325566011353612 |
oct | 253617104247655 |
9 | 45714657860853 |
10 | 11804601307053 |
11 | 3841337768805 |
12 | 13a7989115179 |
13 | 678227757909 |
14 | 2cb4baa58509 |
15 | 1570e88eb803 |
hex | abc79114fad |
11804601307053 has 8 divisors (see below), whose sum is σ = 16164859447648. Its totient is φ = 7657038685584.
The previous prime is 11804601307021. The next prime is 11804601307061. The reversal of 11804601307053 is 35070310640811.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 11804601307053 - 25 = 11804601307021 is a prime.
It is a super-2 number, since 2×118046013070532 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11804601307063) 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, 53173879651 + ... + 53173879872.
It is an arithmetic number, because the mean of its divisors is an integer number (2020607430956).
Almost surely, 211804601307053 is an apocalyptic number.
It is an amenable number.
11804601307053 is a deficient number, since it is larger than the sum of its proper divisors (4360258140595).
11804601307053 is a wasteful number, since it uses less digits than its factorization.
11804601307053 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 106347759563.
The product of its (nonzero) digits is 60480, while the sum is 39.
Adding to 11804601307053 its reverse (35070310640811), we get a palindrome (46874911947864).
The spelling of 11804601307053 in words is "eleven trillion, eight hundred four billion, six hundred one million, three hundred seven thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •