15100253135131 has 2 divisors, whose sum is σ = 15100253135132. Its totient is φ = 15100253135130.

The previous prime is 15100253135113. The next prime is 15100253135137. The reversal of 15100253135131 is 13153135200151.

Together with previous prime (15100253135113) it forms an Ormiston pair, because they use the same digits, order apart.

It is a strong prime.

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2^k-15100253135131 is a prime.

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

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

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

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

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

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

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

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

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

The product of its (nonzero) digits is 6750, while the sum is 31.

Adding to 15100253135131 its reverse (13153135200151), we get a palindrome (28253388335282).

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