110101011100002 has 64 divisors (see below), whose sum is σ = 278988987432960. Its totient is φ = 31884455699712.

The previous prime is 110101011099983. The next prime is 110101011100009. The reversal of 110101011100002 is 200001110101011.

It is a super-2 number, since 2×110101011100002² (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 not an unprimeable number, because it can be changed into a prime (110101011100009) 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 31 ways as a sum of consecutive naturals, for example, 4612901218 + ... + 4612925085.

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

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

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

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

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

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

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

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

Adding to 110101011100002 its reverse (200001110101011), we get a palindrome (310102121201013).

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