110010011957 has 2 divisors, whose sum is σ = 110010011958. Its totient is φ = 110010011956.

The previous prime is 110010011911. The next prime is 110010011983. The reversal of 110010011957 is 759110010011.

It is an a-pointer prime, because the next prime (110010011983) can be obtained adding 110010011957 to its sum of digits (26).

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 94741455601 + 15268556356 = 307801^2 + 123566^2 .

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2^k-110010011957 is a prime.

It is a congruent number.

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

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

Almost surely, 2^110010011957 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 315, while the sum is 26.

Adding to 110010011957 its reverse (759110010011), we get a palindrome (869120021968).

The spelling of 110010011957 in words is "one hundred ten billion, ten million, eleven thousand, nine hundred fifty-seven".