110111101101073 has 2 divisors, whose sum is σ = 110111101101074. Its totient is φ = 110111101101072.

The previous prime is 110111101101037. The next prime is 110111101101217. The reversal of 110111101101073 is 370101101111011.

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

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 98545884912784 + 11565216188289 = 9927028^2 + 3400767^2 .

It is a cyclic number.

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

It is a self number, because there is not a number n which added to its sum of digits gives 110111101101073.

It is not a weakly prime, because it can be changed into another prime (110111101101473) 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, 55055550550536 + 55055550550537.

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

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

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 21, while the sum is 19.

Adding to 110111101101073 its reverse (370101101111011), we get a palindrome (480212202212084).

The spelling of 110111101101073 in words is "one hundred ten trillion, one hundred eleven billion, one hundred one million, one hundred one thousand, seventy-three".