110221101111001 has 4 divisors (see below), whose sum is σ = 110349414384400. Its totient is φ = 110092787837604.

The previous prime is 110221101110921. The next prime is 110221101111179. The reversal of 110221101111001 is 100111101122011.

It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.

It is a cyclic number.

It is not a de Polignac number, because 110221101111001 - 2⁹ = 110221101110489 is a prime.

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

It is a Duffinian number.

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

It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 64156635411 + ... + 64156637128.

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

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

It is an amenable number.

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

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

110221101111001 is an evil number, because the sum of its binary digits is even.

The sum of its prime factors is 128313273398.

The product of its (nonzero) digits is 4, while the sum is 13.

Adding to 110221101111001 its reverse (100111101122011), we get a palindrome (210332202233012).

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