1033010111197 has 2 divisors, whose sum is σ = 1033010111198. Its totient is φ = 1033010111196.

The previous prime is 1033010111179. The next prime is 1033010111213. The reversal of 1033010111197 is 7911110103301.

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

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 800212546116 + 232797565081 = 894546^2 + 482491^2 .

It is a cyclic number.

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

It is a congruent number.

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

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

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

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 567, while the sum is 28.

Adding to 1033010111197 its reverse (7911110103301), we get a palindrome (8944120214498).

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