10113111010133 has 4 divisors (see below), whose sum is σ = 10707999893100. Its totient is φ = 9518222127168.

The previous prime is 10113111010129. The next prime is 10113111010147. The reversal of 10113111010133 is 33101011131101.

It is a semiprime because it is the product of two primes.

It can be written as a sum of positive squares in 2 ways, for example, as 7327756962289 + 2785354047844 = 2706983^2 + 1668938^2 .

It is a cyclic number.

It is not a de Polignac number, because 10113111010133 - 2² = 10113111010129 is a prime.

It is a Harshad number since it is a multiple of its sum of digits (17), and also a Moran number because the ratio is a prime number: 594888882949 = 10113111010133 / (1 + 0 + 1 + 1 + 3 + 1 + 1 + 1 + 0 + 1 + 0 + 1 + 3 + 3).

It is a Duffinian number.

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (10113111010103) by changing a digit.

It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 297444441458 + ... + 297444441491.

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

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

It is an amenable number.

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

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

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

The sum of its prime factors is 594888882966.

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

Adding to 10113111010133 its reverse (33101011131101), we get a palindrome (43214122141234).

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