10110211011013 has 8 divisors (see below), whose sum is σ = 10656175563000. Its totient is φ = 9577402231488.

The previous prime is 10110211010959. The next prime is 10110211011041. The reversal of 10110211011013 is 31011011201101.

10110211011013 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It can be written as a sum of positive squares in 4 ways, for example, as 2525706027009 + 7584504984004 = 1589247^2 + 2753998^2 .

It is a sphenic number, since it is the product of 3 distinct primes.

It is a cyclic number.

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

It is a Duffinian number.

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

It is a congruent number.

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

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3288941538 + ... + 3288944611.

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

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

It is an amenable number.

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

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

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

The sum of its prime factors is 6577886231.

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

Adding to 10110211011013 its reverse (31011011201101), we get a palindrome (41121222212114).

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