10101511350131 has 2 divisors, whose sum is σ = 10101511350132. Its totient is φ = 10101511350130.

The previous prime is 10101511350083. The next prime is 10101511350143. The reversal of 10101511350131 is 13105311510101.

It is a strong prime.

It is a cyclic number.

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

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

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

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

It is a pernicious number, because its binary representation contains a prime number (29) of ones.

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

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

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

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

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

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

The product of its (nonzero) digits is 225, while the sum is 23.

Adding to 10101511350131 its reverse (13105311510101), we get a palindrome (23206822860232).

The spelling of 10101511350131 in words is "ten trillion, one hundred one billion, five hundred eleven million, three hundred fifty thousand, one hundred thirty-one".