110101513 has 2 divisors, whose sum is σ = 110101514. Its totient is φ = 110101512.

The previous prime is 110101501. The next prime is 110101547. The reversal of 110101513 is 315101011.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 103063104 + 7038409 = 10152^2 + 2653^2 .

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

It is a cyclic number.

It is not a de Polignac number, because 110101513 - 2⁹ = 110101001 is a prime.

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

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

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

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

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

Almost surely, 2^110101513 is an apocalyptic number.

It is an amenable number.

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

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

110101513 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 110101513 is about 10492.9268080932. The cubic root of 110101513 is about 479.2893317242.

Adding to 110101513 its reverse (315101011), we get a palindrome (425202524).

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