1102011201013 has 4 divisors (see below), whose sum is σ = 1160011790560. Its totient is φ = 1044010611468.

The previous prime is 1102011201001. The next prime is 1102011201041. The reversal of 1102011201013 is 3101021102011.

It is a happy number.

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 not a de Polignac number, because 1102011201013 - 2⁹ = 1102011200501 is a prime.

It is a super-2 number, since 2×1102011201013² (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 = 1102011200984 and 1102011201002.

It is a congruent number.

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

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

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

It is an amenable number.

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

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

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

The sum of its prime factors is 58000589546.

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

Adding to 1102011201013 its reverse (3101021102011), we get a palindrome (4203032303024).

The spelling of 1102011201013 in words is "one trillion, one hundred two billion, eleven million, two hundred one thousand, thirteen".