1101022110157 has 2 divisors, whose sum is σ = 1101022110158. Its totient is φ = 1101022110156.

The previous prime is 1101022110119. The next prime is 1101022110191. The reversal of 1101022110157 is 7510112201011.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 1090575021636 + 10447088521 = 1044306^2 + 102211^2 .

It is a cyclic number.

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

It is a congruent number.

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

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

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

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

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

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 140, while the sum is 22.

Adding to 1101022110157 its reverse (7510112201011), we get a palindrome (8611134311168).

The spelling of 1101022110157 in words is "one trillion, one hundred one billion, twenty-two million, one hundred ten thousand, one hundred fifty-seven".