Search a number
-
+
112111131533 is a prime number
BaseRepresentation
bin110100001101001011…
…0000001101110001101
3101201101012212120101212
41220122112001232031
53314100422202113
6123300402344205
711046134615612
oct1503226015615
9351335776355
10112111131533
11436008a1515
121988995b065
13a7589b466b
1455d772a509
152db260d0a8
hex1a1a581b8d

112111131533 has 2 divisors, whose sum is σ = 112111131534. Its totient is φ = 112111131532.

The previous prime is 112111131479. The next prime is 112111131541. The reversal of 112111131533 is 335131111211.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 105081650569 + 7029480964 = 324163^2 + 83842^2 .

It is a cyclic number.

It is not a de Polignac number, because 112111131533 - 26 = 112111131469 is a prime.

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

It is a congruent number.

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

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

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

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

Almost surely, 2112111131533 is an apocalyptic number.

It is an amenable number.

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

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

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

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

Adding to 112111131533 its reverse (335131111211), we get a palindrome (447242242744).

The spelling of 112111131533 in words is "one hundred twelve billion, one hundred eleven million, one hundred thirty-one thousand, five hundred thirty-three".