16911131 has 2 divisors, whose sum is σ = 16911132. Its totient is φ = 16911130.

The previous prime is 16911113. The next prime is 16911161. The reversal of 16911131 is 13111961.

Together with previous prime (16911113) it forms an Ormiston pair, because they use the same digits, order apart.

It is a weak prime.

It is an emirp because it is prime and its reverse (13111961) is a distict prime.

It is a cyclic number.

It is not a de Polignac number, because 16911131 - 2⁶ = 16911067 is a prime.

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

It is a Sophie Germain prime.

It is a Chen prime.

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

It is not a weakly prime, because it can be changed into another prime (16911101) by changing a digit.

It is a polite number, since it can be written as a sum of consecutive naturals, namely, 8455565 + 8455566.

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

Almost surely, 2^16911131 is an apocalyptic number.

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

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

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

The product of its digits is 162, while the sum is 23.

The square root of 16911131 is about 4112.3145550894. The cubic root of 16911131 is about 256.6793226645.

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