110401513 has 2 divisors, whose sum is σ = 110401514. Its totient is φ = 110401512.

The previous prime is 110401483. The next prime is 110401531. The reversal of 110401513 is 315104011.

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

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 79798489 + 30603024 = 8933^2 + 5532^2 .

It is a cyclic number.

It is not a de Polignac number, because 110401513 - 2¹³ = 110393321 is a prime.

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

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

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

Almost surely, 2^110401513 is an apocalyptic number.

It is an amenable number.

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

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

110401513 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 16.

The square root of 110401513 is about 10507.2124276613. The cubic root of 110401513 is about 479.7242527899.

Adding to 110401513 its reverse (315104011), we get a palindrome (425505524).

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