100000001110913 has 2 divisors, whose sum is σ = 100000001110914. Its totient is φ = 100000001110912.

The previous prime is 100000001110883. The next prime is 100000001110921. The reversal of 100000001110913 is 319011100000001.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 88991620330369 + 11008380780544 = 9433537^2 + 3317888^2 .

It is a cyclic number.

It is not a de Polignac number, because 100000001110913 - 2¹⁶ = 100000001045377 is a prime.

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

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

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

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

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

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 27, while the sum is 17.

Adding to 100000001110913 its reverse (319011100000001), we get a palindrome (419011101110914).

The spelling of 100000001110913 in words is "one hundred trillion, one million, one hundred ten thousand, nine hundred thirteen".