Base | Representation |
---|---|
bin | 1011111011001000001100… |
… | …1100111110011111011101 |
3 | 1201102100100012111011121222 |
4 | 2332302003030332133131 |
5 | 3204300140444420011 |
6 | 43514504215103125 |
7 | 2522124650141156 |
oct | 276620314763735 |
9 | 51370305434558 |
10 | 13110441404381 |
11 | 41a511a425512 |
12 | 1578a84371aa5 |
13 | 741403762739 |
14 | 334797aaa92d |
15 | 17b0753c0ddb |
hex | bec8333e7dd |
13110441404381 has 2 divisors, whose sum is σ = 13110441404382. Its totient is φ = 13110441404380.
The previous prime is 13110441404329. The next prime is 13110441404449. The reversal of 13110441404381 is 18340414401131.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 9970248304900 + 3140193099481 = 3157570^2 + 1772059^2 .
It is an emirp because it is prime and its reverse (18340414401131) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 13110441404381 - 218 = 13110441142237 is a prime.
It is a super-2 number, since 2×131104414043812 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13110441404311) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6555220702190 + 6555220702191.
It is an arithmetic number, because the mean of its divisors is an integer number (6555220702191).
Almost surely, 213110441404381 is an apocalyptic number.
It is an amenable number.
13110441404381 is a deficient number, since it is larger than the sum of its proper divisors (1).
13110441404381 is an equidigital number, since it uses as much as digits as its factorization.
13110441404381 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 18432, while the sum is 35.
The spelling of 13110441404381 in words is "thirteen trillion, one hundred ten billion, four hundred forty-one million, four hundred four thousand, three hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.101 sec. • engine limits •