1101031100113 has 4 divisors (see below), whose sum is σ = 1258321257280. Its totient is φ = 943740942948.

The previous prime is 1101031100021. The next prime is 1101031100231. The reversal of 1101031100113 is 3110011301011.

It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.

It is a cyclic number.

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

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

It is a Duffinian number.

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

It is not an unprimeable number, because it can be changed into a prime (1101031106113) 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, 78645078573 + ... + 78645078586.

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

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

It is an amenable number.

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

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

1101031100113 is an evil number, because the sum of its binary digits is even.

The sum of its prime factors is 157290157166.

The product of its (nonzero) digits is 9, while the sum is 13.

Adding to 1101031100113 its reverse (3110011301011), we get a palindrome (4211042401124).

The spelling of 1101031100113 in words is "one trillion, one hundred one billion, thirty-one million, one hundred thousand, one hundred thirteen".