101100110010113 has 2 divisors, whose sum is σ = 101100110010114. Its totient is φ = 101100110010112.

The previous prime is 101100110010071. The next prime is 101100110010259. The reversal of 101100110010113 is 311010011001101.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 87627047908624 + 13473062101489 = 9360932^2 + 3670567^2 .

It is a cyclic number.

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

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

It is not a weakly prime, because it can be changed into another prime (101100110012113) by changing a digit.

It is a pernicious number, because its binary representation contains a prime number (23) of ones.

It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50550055005056 + 50550055005057.

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

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

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 3, while the sum is 11.

Adding to 101100110010113 its reverse (311010011001101), we get a palindrome (412110121011214).

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