5015130315137 has 2 divisors, whose sum is σ = 5015130315138. Its totient is φ = 5015130315136.

The previous prime is 5015130315101. The next prime is 5015130315191. The reversal of 5015130315137 is 7315130315105.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 4916082266176 + 99048048961 = 2217224^2 + 314719^2 .

It is a cyclic number.

It is not a de Polignac number, because 5015130315137 - 2¹⁰ = 5015130314113 is a prime.

It is a super-4 number, since 4×5015130315137⁴ (a number of 52 digits) contains 4444 as substring. Note that it is a super-d number also for d = 2.

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

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

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

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

Almost surely, 2^{5015130315137} is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 23625, while the sum is 35.

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