Search a number
-
+
15561116505013 is a prime number
BaseRepresentation
bin1110001001110001101011…
…0100100101001110110101
32001002121221222001020011211
43202130122310211032311
54014423131311130023
653032402255401421
73164152654611352
oct342343264451665
961077858036154
1015561116505013
114a5a483653852
1218b3a22523271
1388b53a206a91
143bb23a985629
151beba8a41a0d
hexe271ad253b5

15561116505013 has 2 divisors, whose sum is σ = 15561116505014. Its totient is φ = 15561116505012.

The previous prime is 15561116504993. The next prime is 15561116505023. The reversal of 15561116505013 is 31050561116551.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 12980794734769 + 2580321770244 = 3602887^2 + 1606338^2 .

It is a cyclic number.

It is not a de Polignac number, because 15561116505013 - 29 = 15561116504501 is a prime.

It is a congruent number.

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

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

Almost surely, 215561116505013 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 67500, while the sum is 40.

The spelling of 15561116505013 in words is "fifteen trillion, five hundred sixty-one billion, one hundred sixteen million, five hundred five thousand, thirteen".