Search a number
-
+
13105346614537 is a prime number
BaseRepresentation
bin1011111010110101001110…
…0001111001010100001001
31201101212012010202000211211
42332231103201321110021
53204204222213131122
643512302500053121
72521554464141362
oct276552341712411
951355163660754
1013105346614537
1141a2a455654a1
121577aa20941a1
13740aa10959a8
143344331b2b69
1517ad77e93877
hexbeb53879509

13105346614537 has 2 divisors, whose sum is σ = 13105346614538. Its totient is φ = 13105346614536.

The previous prime is 13105346614489. The next prime is 13105346614541. The reversal of 13105346614537 is 73541664350131.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 7549987180176 + 5555359434361 = 2747724^2 + 2356981^2 .

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-13105346614537 is a prime.

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

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

Almost surely, 213105346614537 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 2721600, while the sum is 49.

The spelling of 13105346614537 in words is "thirteen trillion, one hundred five billion, three hundred forty-six million, six hundred fourteen thousand, five hundred thirty-seven".