110100110101101 has 12 divisors (see below), whose sum is σ = 159466826139712. Its totient is φ = 73200073198536.

The previous prime is 110100110101061. The next prime is 110100110101109. The reversal of 110100110101101 is 101101011001011.

It is not a de Polignac number, because 110100110101101 - 2¹³ = 110100110092909 is a prime.

It is a Harshad number since it is a multiple of its sum of digits (9).

It is a Duffinian number.

110100110101101 is a modest number, since divided by 110101101 gives 11010 as remainder.

It is a congruent number.

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

It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 16666680031 + ... + 16666686636.

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

It is an amenable number.

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

110100110101101 is a wasteful number, since it uses less digits than its factorization.

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

The sum of its prime factors is 33333367040 (or 33333367037 counting only the distinct ones).

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

Adding to 110100110101101 its reverse (101101011001011), we get a palindrome (211201121102112).

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