Search a number
BaseRepresentation
bin1011111010110001011100…
…0000110101000010101001
31201101202120101021101102002
42332230113000311002221
53204200132304011241
643512014030420345
72521520355211463
oct276542700650251
951352511241362
1013104331313321
1141a2574440686
12157785a0616b5
1374096b92c041
14334378401133
hexbeb170350a9

13104331313321 has 2 divisors, whose sum is σ = 13104331313322. Its totient is φ = 13104331313320.

The previous prime is 13104331313299. The next prime is 13104331313369. The reversal of 13104331313321 is 12331313340131.

Adding to 13104331313321 its reverse (12331313340131), we get a palindrome (25435644653452).

It is a happy number.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 12930388933225 + 173942380096 = 3595885^2 + 417064^2 .

It is an emirp because it is prime and its reverse (12331313340131) is a distict prime.

It is a cyclic number.

It is not a de Polignac number, because 13104331313321 - 214 = 13104331296937 is a prime.

It is not a weakly prime, because it can be changed into another prime (13104331313221) by changing a digit.

It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6552165656660 + 6552165656661.

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

Almost surely, 213104331313321 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 5832, while the sum is 29.

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