110956913 has 6 divisors (see below), whose sum is σ = 111401046. Its totient is φ = 110514432.

The previous prime is 110956907. The next prime is 110956927. The reversal of 110956913 is 319659011.

It can be written as a sum of positive squares in 3 ways, for example, as 18258529 + 92698384 = 4273^2 + 9628^2 .

It is not a de Polignac number, because 110956913 - 2¹² = 110952817 is a prime.

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

It is a Duffinian number.

It is not an unprimeable number, because it can be changed into a prime (110956213) 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 5 ways as a sum of consecutive naturals, for example, 113081 + ... + 114057.

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

Almost surely, 2^110956913 is an apocalyptic number.

It is an amenable number.

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

110956913 is an frugal number, since it uses more digits than its factorization.

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

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

The product of its (nonzero) digits is 7290, while the sum is 35.

The square root of 110956913 is about 10533.6087358512. The cubic root of 110956913 is about 480.5273616529.

The spelling of 110956913 in words is "one hundred ten million, nine hundred fifty-six thousand, nine hundred thirteen".