110110100000009 has 2 divisors, whose sum is σ = 110110100000010. Its totient is φ = 110110100000008.

The previous prime is 110110099999993. The next prime is 110110100000023. The reversal of 110110100000009 is 900000001011011.

It is a happy number.

It is an a-pointer prime, because the next prime (110110100000023) can be obtained adding 110110100000009 to its sum of digits (14).

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 109848950383225 + 261149616784 = 10480885^2 + 511028^2 .

It is an emirp because it is prime and its reverse (900000001011011) is a distict prime.

It is a cyclic number.

It is not a de Polignac number, because 110110100000009 - 2⁴ = 110110099999993 is a prime.

It is a Sophie Germain prime.

It is a Curzon number.

It is a junction number, because it is equal to n+sod(n) for n = 110110099999939 and 110110100000002.

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

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

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

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 9, while the sum is 14.

The spelling of 110110100000009 in words is "one hundred ten trillion, one hundred ten billion, one hundred million, nine", and thus it is an aban number.