1000110010997 has 2 divisors, whose sum is σ = 1000110010998. Its totient is φ = 1000110010996.

The previous prime is 1000110010979. The next prime is 1000110011051. The reversal of 1000110010997 is 7990100110001.

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

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 644272707556 + 355837303441 = 802666^2 + 596521^2 .

It is a cyclic number.

It is not a de Polignac number, because 1000110010997 - 2⁸ = 1000110010741 is a prime.

It is a congruent number.

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

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

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

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

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

It is an amenable number.

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

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

1000110010997 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 29.

Adding to 1000110010997 its reverse (7990100110001), we get a palindrome (8990210120998).

The spelling of 1000110010997 in words is "one trillion, one hundred ten million, ten thousand, nine hundred ninety-seven".