101511013 has 2 divisors, whose sum is σ = 101511014. Its totient is φ = 101511012.

The previous prime is 101511001. The next prime is 101511031. The reversal of 101511013 is 310115101.

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

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 100340289 + 1170724 = 10017^2 + 1082^2 .

It is an emirp because it is prime and its reverse (310115101) is a distict prime.

It is a cyclic number.

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

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

It is a congruent number.

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

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

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

Almost surely, 2^101511013 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 15, while the sum is 13.

The square root of 101511013 is about 10075.2673909927. The cubic root of 101511013 is about 466.4850399209.

Adding to 101511013 its reverse (310115101), we get a palindrome (411626114).

The spelling of 101511013 in words is "one hundred one million, five hundred eleven thousand, thirteen".