Search a number
BaseRepresentation
bin1011111010110001011100…
…0000110101100001011011
31201101202120101021111010001
42332230113000311201123
53204200132304042131
643512014030433431
72521520355220306
oct276542700654133
951352511244101
1013104331315291
1141a2574442107
12157785a062877
1374096b92cbc8
14334378401b3d
hexbeb1703585b

13104331315291 has 2 divisors, whose sum is σ = 13104331315292. Its totient is φ = 13104331315290.

The previous prime is 13104331315277. The next prime is 13104331315321. The reversal of 13104331315291 is 19251313340131.

It is a happy number.

It is a weak prime.

It is a cyclic number.

It is not a de Polignac number, because 13104331315291 - 29 = 13104331314779 is a prime.

It is a self number, because there is not a number n which added to its sum of digits gives 13104331315291.

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

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

Almost surely, 213104331315291 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 29160, while the sum is 37.

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