Search a number
-
+
15105615600013 is a prime number
BaseRepresentation
bin1101101111010000110011…
…0110100001100110001101
31222111002020022201202111221
43123310030312201212031
53434442300043200023
652043231330243341
73116226144033601
oct333641466414615
958432208652457
1015105615600013
1148a428a227024
12183b6a0126551
138575b8289163
143a3189681501
151b2de98a585d
hexdbd0cda198d

15105615600013 has 2 divisors, whose sum is σ = 15105615600014. Its totient is φ = 15105615600012.

The previous prime is 15105615600001. The next prime is 15105615600079. The reversal of 15105615600013 is 31000651650151.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 7993297326564 + 7112318273449 = 2827242^2 + 2666893^2 .

It is a cyclic number.

It is not a de Polignac number, because 15105615600013 - 217 = 15105615468941 is a prime.

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

It is a congruent number.

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

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

Almost surely, 215105615600013 is an apocalyptic number.

It is an amenable number.

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

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

15105615600013 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 34.

The spelling of 15105615600013 in words is "fifteen trillion, one hundred five billion, six hundred fifteen million, six hundred thousand, thirteen".