Search a number
-
+
13105405530311 is a prime number
BaseRepresentation
bin1011111010110101011100…
…0010101001000011000111
31201101212100020121021002112
42332231113002221003013
53204204332303432221
643512312402531235
72521556111001443
oct276552702510307
951355306537075
1013105405530311
1141a2a75845816
121577ab9966b1b
13740ab03532b3
1433443ad4b823
1517ad7d23015b
hexbeb570a90c7

13105405530311 has 2 divisors, whose sum is σ = 13105405530312. Its totient is φ = 13105405530310.

The previous prime is 13105405530247. The next prime is 13105405530313. The reversal of 13105405530311 is 11303550450131.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 13105405530311 - 26 = 13105405530247 is a prime.

It is a super-2 number, since 2×131054055303112 (a number of 27 digits) contains 22 as substring.

Together with 13105405530313, it forms a pair of twin primes.

It is a Chen prime.

It is a congruent number.

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

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

Almost surely, 213105405530311 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 13500, while the sum is 32.

Adding to 13105405530311 its reverse (11303550450131), we get a palindrome (24408955980442).

The spelling of 13105405530311 in words is "thirteen trillion, one hundred five billion, four hundred five million, five hundred thirty thousand, three hundred eleven".