110145500681 has 4 divisors (see below), whose sum is σ = 110191187664. Its totient is φ = 110099813700.

The previous prime is 110145500669. The next prime is 110145500711. The reversal of 110145500681 is 186005541011.

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 a de Polignac number, because none of the positive numbers 2^k-110145500681 is a prime.

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

It is a Duffinian number.

It is a Curzon number.

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

It is a pernicious number, because its binary representation contains a prime number (19) of ones.

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

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

Almost surely, 2^110145500681 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 45686982.

The product of its (nonzero) digits is 4800, while the sum is 32.

The spelling of 110145500681 in words is "one hundred ten billion, one hundred forty-five million, five hundred thousand, six hundred eighty-one".