110101010021001 has 32 divisors (see below), whose sum is σ = 163146351139200. Its totient is φ = 73385490551040.

The previous prime is 110101010020951. The next prime is 110101010021011. The reversal of 110101010021001 is 100120010101011.

It is not a de Polignac number, because 110101010021001 - 2⁷ = 110101010020873 is a prime.

It is a super-2 number, since 2×110101010021001² (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 Curzon number.

It is not an unprimeable number, because it can be changed into a prime (110101010021011) 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, 5009817925 + ... + 5009839901.

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

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

It is an amenable number.

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

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

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

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

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

Adding to 110101010021001 its reverse (100120010101011), we get a palindrome (210221020122012).

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