931000111111001 has 2 divisors, whose sum is σ = 931000111111002. Its totient is φ = 931000111111000.

The previous prime is 931000111110991. The next prime is 931000111111027. The reversal of 931000111111001 is 100111111000139.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 831562418406976 + 99437692704025 = 28836824^2 + 9971845^2 .

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

It is a cyclic number.

It is not a de Polignac number, because 931000111111001 - 2¹⁴ = 931000111094617 is a prime.

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

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

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

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

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

Almost surely, 2^{931000111111001} is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 27, while the sum is 20.

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