10113111110369 has 2 divisors, whose sum is σ = 10113111110370. Its totient is φ = 10113111110368.

The previous prime is 10113111110329. The next prime is 10113111110393. The reversal of 10113111110369 is 96301111131101.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 7153420969744 + 2959690140625 = 2674588^2 + 1720375^2 .

It is a cyclic number.

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

It is a super-2 number, since 2×10113111110369² (a number of 27 digits) contains 22 as substring.

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

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

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

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 486, while the sum is 29.

The spelling of 10113111110369 in words is "ten trillion, one hundred thirteen billion, one hundred eleven million, one hundred ten thousand, three hundred sixty-nine".