9790111110133 has 2 divisors, whose sum is σ = 9790111110134. Its totient is φ = 9790111110132.

The previous prime is 9790111110083. The next prime is 9790111110137. The reversal of 9790111110133 is 3310111110979.

9790111110133 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 9514467209809 + 275643900324 = 3084553^2 + 525018^2 .

It is a cyclic number.

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

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

It is a congruent number.

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

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

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

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

It is an amenable number.

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

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

9790111110133 is an evil number, because the sum of its binary digits is even.

The product of its (nonzero) digits is 5103, while the sum is 37.

The spelling of 9790111110133 in words is "nine trillion, seven hundred ninety billion, one hundred eleven million, one hundred ten thousand, one hundred thirty-three".