110642713 has 4 divisors (see below), whose sum is σ = 110723200. Its totient is φ = 110562228.

The previous prime is 110642699. The next prime is 110642729. The reversal of 110642713 is 317246011.

It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 317246011 = 479 ⋅662309.

It is a cyclic number.

It is not a de Polignac number, because 110642713 - 2¹⁷ = 110511641 is a prime.

It is a Duffinian number.

It is not an unprimeable number, because it can be changed into a prime (110642513) by changing a digit.

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

It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 38145 + ... + 40942.

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

Almost surely, 2^110642713 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 80486.

The product of its (nonzero) digits is 1008, while the sum is 25.

The square root of 110642713 is about 10518.6839956337. The cubic root of 110642713 is about 480.0733582904.

Adding to 110642713 its reverse (317246011), we get a palindrome (427888724).

The spelling of 110642713 in words is "one hundred ten million, six hundred forty-two thousand, seven hundred thirteen".