110270991 has 8 divisors (see below), whose sum is σ = 147965104. Its totient is φ = 73045440.

The previous prime is 110270987. The next prime is 110271011. The reversal of 110270991 is 199072011.

It is a sphenic number, since it is the product of 3 distinct primes.

It is not a de Polignac number, because 110270991 - 2² = 110270987 is a prime.

It is a super-2 number, since 2×110270991² = 24319382912244162, which contains 22 as substring.

It is a Duffinian number.

It is a congruent number.

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

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

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 116590 + ... + 117531.

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

Almost surely, 2^110270991 is an apocalyptic number.

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

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

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

The sum of its prime factors is 234281.

The product of its (nonzero) digits is 1134, while the sum is 30.

The square root of 110270991 is about 10500.9995238549. Note that the first 3 decimals coincide. The cubic root of 110270991 is about 479.5351271799.

The spelling of 110270991 in words is "one hundred ten million, two hundred seventy thousand, nine hundred ninety-one".