Base | Representation |
---|---|
bin | 1011111010110001011100… |
… | …0100010001001110111101 |
3 | 1201101202120102222012121002 |
4 | 2332230113010101032331 |
5 | 3204200133021341404 |
6 | 43512014102020045 |
7 | 2521520365656113 |
oct | 276542704211675 |
9 | 51352512865532 |
10 | 13104332215229 |
11 | 41a25749a7262 |
12 | 157785a417625 |
13 | 74096bb86708 |
14 | 334378597ab3 |
15 | 17ad18dbac1e |
hex | beb171113bd |
13104332215229 has 2 divisors, whose sum is σ = 13104332215230. Its totient is φ = 13104332215228.
The previous prime is 13104332215213. The next prime is 13104332215253. The reversal of 13104332215229 is 92251223340131.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 12441739471225 + 662592744004 = 3527285^2 + 813998^2 .
It is an emirp because it is prime and its reverse (92251223340131) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 13104332215229 - 24 = 13104332215213 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 13104332215192 and 13104332215201.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13104332245229) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6552166107614 + 6552166107615.
It is an arithmetic number, because the mean of its divisors is an integer number (6552166107615).
Almost surely, 213104332215229 is an apocalyptic number.
It is an amenable number.
13104332215229 is a deficient number, since it is larger than the sum of its proper divisors (1).
13104332215229 is an equidigital number, since it uses as much as digits as its factorization.
13104332215229 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 77760, while the sum is 38.
The spelling of 13104332215229 in words is "thirteen trillion, one hundred four billion, three hundred thirty-two million, two hundred fifteen thousand, two hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •