Search a number
-
+
15104605312337 is a prime number
BaseRepresentation
bin1101101111001101000010…
…1000100101010101010001
31222110222121220200211100212
43123303100220211111101
53434433212424443322
652042543200253505
73116162125524512
oct333632050452521
958428556624325
1015104605312337
1148a3910a16a32
12183b459911295
13857486b894b8
143a30d1416a09
151b2d8ad410e2
hexdbcd0a25551

15104605312337 has 2 divisors, whose sum is σ = 15104605312338. Its totient is φ = 15104605312336.

The previous prime is 15104605312249. The next prime is 15104605312409. The reversal of 15104605312337 is 73321350640151.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 13144112481361 + 1960492830976 = 3625481^2 + 1400176^2 .

It is a cyclic number.

It is not a de Polignac number, because 15104605312337 - 226 = 15104538203473 is a prime.

It is a junction number, because it is equal to n+sod(n) for n = 15104605312294 and 15104605312303.

It is not a weakly prime, because it can be changed into another prime (15104605312837) by changing a digit.

It is a polite number, since it can be written as a sum of consecutive naturals, namely, 7552302656168 + 7552302656169.

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

Almost surely, 215104605312337 is an apocalyptic number.

It is an amenable number.

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

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

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

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

Adding to 15104605312337 its reverse (73321350640151), we get a palindrome (88425955952488).

The spelling of 15104605312337 in words is "fifteen trillion, one hundred four billion, six hundred five million, three hundred twelve thousand, three hundred thirty-seven".