105026514713 has 2 divisors, whose sum is σ = 105026514714. Its totient is φ = 105026514712.

The previous prime is 105026514629. The next prime is 105026514731. The reversal of 105026514713 is 317415620501.

It is a happy number.

Together with next prime (105026514731) 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., 81460580569 + 23565934144 = 285413^2 + 153512^2 .

It is a cyclic number.

It is not a de Polignac number, because 105026514713 - 2⁸ = 105026514457 is a prime.

It is a super-2 number, since 2×105026514713² (a number of 23 digits) contains 22 as substring.

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

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

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

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

Almost surely, 2^105026514713 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 25200, while the sum is 35.

The spelling of 105026514713 in words is "one hundred five billion, twenty-six million, five hundred fourteen thousand, seven hundred thirteen".