110011099485713 has 2 divisors, whose sum is σ = 110011099485714. Its totient is φ = 110011099485712.

The previous prime is 110011099485667. The next prime is 110011099485719. The reversal of 110011099485713 is 317584990110011.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 107670652343809 + 2340447141904 = 10376447^2 + 1529852^2 .

It is a cyclic number.

It is not a de Polignac number, because 110011099485713 - 2⁸ = 110011099485457 is a prime.

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

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

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

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

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

Almost surely, 2^{110011099485713} is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 272160, while the sum is 50.

The spelling of 110011099485713 in words is "one hundred ten trillion, eleven billion, ninety-nine million, four hundred eighty-five thousand, seven hundred thirteen".