11516931 has 8 divisors (see below), whose sum is σ = 17062160. Its totient is φ = 7677936.

The previous prime is 11516909. The next prime is 11516933. The reversal of 11516931 is 13961511.

It is not a de Polignac number, because 11516931 - 2⁹ = 11516419 is a prime.

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

It is a Harshad number since it is a multiple of its sum of digits (27), and also a Moran number because the ratio is a prime number: 426553 = 11516931 / (1 + 1 + 5 + 1 + 6 + 9 + 3 + 1).

It is a Duffinian number.

It is a junction number, because it is equal to n+sod(n) for n = 11516895 and 11516904.

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

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

Almost surely, 2^11516931 is an apocalyptic number.

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

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

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

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

The product of its digits is 810, while the sum is 27.

The square root of 11516931 is about 3393.6604131822. The cubic root of 11516931 is about 225.8285893198.

The spelling of 11516931 in words is "eleven million, five hundred sixteen thousand, nine hundred thirty-one".