10100101513 has 2 divisors, whose sum is σ = 10100101514. Its totient is φ = 10100101512.

The previous prime is 10100101507. The next prime is 10100101541. The reversal of 10100101513 is 31510100101.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 9839052864 + 261048649 = 99192^2 + 16157^2 .

It is a cyclic number.

It is not a de Polignac number, because 10100101513 - 2⁹ = 10100101001 is a prime.

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

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

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

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

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

Almost surely, 2^10100101513 is an apocalyptic number.

It is an amenable number.

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

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

10100101513 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.

Adding to 10100101513 its reverse (31510100101), we get a palindrome (41610201614).

The spelling of 10100101513 in words is "ten billion, one hundred million, one hundred one thousand, five hundred thirteen".