Search a number
-
+
11553300052709 is a prime number
BaseRepresentation
bin1010100000011111011001…
…0110000111101011100101
31111220111002100022121110012
42220013312112013223211
53003242124303141314
640323302431540005
72301461355060452
oct250076626075345
944814070277405
1011553300052709
1137547aa75a948
12136713498a605
1365a618c11b4c
142bd27b4ba829
151507db74593e
hexa81f6587ae5

11553300052709 has 2 divisors, whose sum is σ = 11553300052710. Its totient is φ = 11553300052708.

The previous prime is 11553300052661. The next prime is 11553300052741. The reversal of 11553300052709 is 90725000335511.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 11326738332484 + 226561720225 = 3365522^2 + 475985^2 .

It is a cyclic number.

It is not a de Polignac number, because 11553300052709 - 212 = 11553300048613 is a prime.

It is a congruent number.

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

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

Almost surely, 211553300052709 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 141750, while the sum is 41.

The spelling of 11553300052709 in words is "eleven trillion, five hundred fifty-three billion, three hundred million, fifty-two thousand, seven hundred nine".