Base | Representation |
---|---|
bin | 1011111010110000010100… |
… | …1100101001000011001001 |
3 | 1201101201210112212000220121 |
4 | 2332230011030221003021 |
5 | 3204144024244420131 |
6 | 43511524232223241 |
7 | 2521510065521503 |
oct | 276540514510311 |
9 | 51351715760817 |
10 | 13104032420041 |
11 | 41a2430752742 |
12 | 1577795b3ab21 |
13 | 740921a2ac04 |
14 | 33434a838d73 |
15 | 17acec8ec911 |
hex | beb053290c9 |
13104032420041 has 16 divisors (see below), whose sum is σ = 13976609616000. Its totient is φ = 12242863283968.
The previous prime is 13104032420021. The next prime is 13104032420057. The reversal of 13104032420041 is 14002423040131.
It is a cyclic number.
It is not a de Polignac number, because 13104032420041 - 219 = 13104031895753 is a prime.
It is a super-3 number, since 3×131040324200413 (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 = 13104032419988 and 13104032420015.
It is not an unprimeable number, because it can be changed into a prime (13104032420021) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2503236 + ... + 5698618.
It is an arithmetic number, because the mean of its divisors is an integer number (873538101000).
Almost surely, 213104032420041 is an apocalyptic number.
It is an amenable number.
13104032420041 is a deficient number, since it is larger than the sum of its proper divisors (872577195959).
13104032420041 is a wasteful number, since it uses less digits than its factorization.
13104032420041 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3197168.
The product of its (nonzero) digits is 2304, while the sum is 25.
Adding to 13104032420041 its reverse (14002423040131), we get a palindrome (27106455460172).
The spelling of 13104032420041 in words is "thirteen trillion, one hundred four billion, thirty-two million, four hundred twenty thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •