Search a number
-
+
111331071041 is a prime number
BaseRepresentation
bin110011110101111011…
…0010101010001000001
3101122100212001101120112
41213223312111101001
53311001223233131
6123051135121105
711020613330021
oct1475366252101
9348325041515
10111331071041
114324053a523
12196b0673195
13a6631c34c8
145561cb1a81
152d68dc402b
hex19ebd95441

111331071041 has 2 divisors, whose sum is σ = 111331071042. Its totient is φ = 111331071040.

The previous prime is 111331071037. The next prime is 111331071043. The reversal of 111331071041 is 140170133111.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 94415467441 + 16915603600 = 307271^2 + 130060^2 .

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

It is a cyclic number.

It is not a de Polignac number, because 111331071041 - 22 = 111331071037 is a prime.

Together with 111331071043, it forms a pair of twin primes.

It is a Chen prime.

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

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

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

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

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

Almost surely, 2111331071041 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 252, while the sum is 23.

The spelling of 111331071041 in words is "one hundred eleven billion, three hundred thirty-one million, seventy-one thousand, forty-one".