Search a number
BaseRepresentation
bin1011111010110001011100…
…0000110101100001111001
31201101202120101021111011011
42332230113000311201321
53204200132304042241
643512014030433521
72521520355220351
oct276542700654171
951352511244134
1013104331315321
1141a2574442134
12157785a0628a1
1374096b92cc1c
14334378401b61
hexbeb17035879

13104331315321 has 2 divisors, whose sum is σ = 13104331315322. Its totient is φ = 13104331315320.

The previous prime is 13104331315291. The next prime is 13104331315349. The reversal of 13104331315321 is 12351313340131.

Adding to 13104331315321 its reverse (12351313340131), we get a palindrome (25455644655452).

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 8653075275321 + 4451256040000 = 2941611^2 + 2109800^2 .

It is a cyclic number.

It is not a de Polignac number, because 13104331315321 - 213 = 13104331307129 is a prime.

It is not a weakly prime, because it can be changed into another prime (13104331313321) 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, 6552165657660 + 6552165657661.

It is an arithmetic number, because the mean of its divisors is an integer number (6552165657661).

Almost surely, 213104331315321 is an apocalyptic number.

It is an amenable number.

13104331315321 is a deficient number, since it is larger than the sum of its proper divisors (1).

13104331315321 is an equidigital number, since it uses as much as digits as its factorization.

13104331315321 is an odious number, because the sum of its binary digits is odd.

The product of its (nonzero) digits is 9720, while the sum is 31.

The spelling of 13104331315321 in words is "thirteen trillion, one hundred four billion, three hundred thirty-one million, three hundred fifteen thousand, three hundred twenty-one".