Search a number
BaseRepresentation
bin1011111010110001011100…
…0000110011100001111001
31201101202120101021001220202
42332230113000303201321
53204200132303312004
643512014030331545
72521520355154436
oct276542700634171
951352511231822
1013104331307129
1141a2574436a67
12157785a059bb5
1374096b92928a
143343783dcb8d
hexbeb17033879

13104331307129 has 2 divisors, whose sum is σ = 13104331307130. Its totient is φ = 13104331307128.

The previous prime is 13104331307107. The next prime is 13104331307143. The reversal of 13104331307129 is 92170313340131.

It is a happy number.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 8798075484025 + 4306255823104 = 2966155^2 + 2075152^2 .

It is a cyclic number.

It is not a de Polignac number, because 13104331307129 - 224 = 13104314529913 is a prime.

It is a Sophie Germain prime.

It is a Curzon number.

It is a junction number, because it is equal to n+sod(n) for n = 13104331307092 and 13104331307101.

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

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

Almost surely, 213104331307129 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 40824, while the sum is 38.

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