10101311015141 has 2 divisors, whose sum is σ = 10101311015142. Its totient is φ = 10101311015140.

The previous prime is 10101311015137. The next prime is 10101311015161. The reversal of 10101311015141 is 14151011310101.

It is an a-pointer prime, because the next prime (10101311015161) can be obtained adding 10101311015141 to its sum of digits (20).

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 9014681982916 + 1086629032225 = 3002446^2 + 1042415^2 .

It is a cyclic number.

It is not a de Polignac number, because 10101311015141 - 2² = 10101311015137 is a prime.

It is a congruent number.

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

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

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

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

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 60, while the sum is 20.

Adding to 10101311015141 its reverse (14151011310101), we get a palindrome (24252322325242).

The spelling of 10101311015141 in words is "ten trillion, one hundred one billion, three hundred eleven million, fifteen thousand, one hundred forty-one".