110100010110102 has 32 divisors (see below), whose sum is σ = 246286998351360. Its totient is φ = 36456956987400.

The previous prime is 110100010110091. The next prime is 110100010110109. The reversal of 110100010110102 is 201011010001011.

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

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

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (110100010110109) 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 in 15 ways as a sum of consecutive naturals, for example, 6751280178 + ... + 6751296485.

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

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

110100010110102 is an abundant number, since it is smaller than the sum of its proper divisors (136186988241258).

It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.

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

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

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

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

Adding to 110100010110102 its reverse (201011010001011), we get a palindrome (311111020111113).

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