Base | Representation |
---|---|
bin | 1011111010110001011100… |
… | …0000110101100011011001 |
3 | 1201101202120101021111021201 |
4 | 2332230113000311203121 |
5 | 3204200132304043132 |
6 | 43512014030434201 |
7 | 2521520355220546 |
oct | 276542700654331 |
9 | 51352511244251 |
10 | 13104331315417 |
11 | 41a2574442211 |
12 | 157785a062961 |
13 | 74096b92cc94 |
14 | 334378401bcd |
15 | 17ad18c8e2e7 |
hex | beb170358d9 |
13104331315417 has 2 divisors, whose sum is σ = 13104331315418. Its totient is φ = 13104331315416.
The previous prime is 13104331315379. The next prime is 13104331315447. The reversal of 13104331315417 is 71451313340131.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 13096263503376 + 8067812041 = 3618876^2 + 89821^2 .
It is a cyclic number.
It is not a de Polignac number, because 13104331315417 - 211 = 13104331313369 is a prime.
It is not a weakly prime, because it can be changed into another prime (13104331315447) 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 as a sum of consecutive naturals, namely, 6552165657708 + 6552165657709.
It is an arithmetic number, because the mean of its divisors is an integer number (6552165657709).
Almost surely, 213104331315417 is an apocalyptic number.
It is an amenable number.
13104331315417 is a deficient number, since it is larger than the sum of its proper divisors (1).
13104331315417 is an equidigital number, since it uses as much as digits as its factorization.
13104331315417 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 45360, while the sum is 37.
Adding to 13104331315417 its reverse (71451313340131), we get a palindrome (84555644655548).
The spelling of 13104331315417 in words is "thirteen trillion, one hundred four billion, three hundred thirty-one million, three hundred fifteen thousand, four hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •