Search a number
-
+
112341106529 is a prime number
BaseRepresentation
bin110100010100000001…
…1010011111101100001
3101201222020121111210022
41220220003103331201
53320033310402104
6123335255443225
711054626435631
oct1505003237541
9351866544708
10112341106529
11437096980a3
1219932986515
13a794535442
14561a0b26c1
152dc78d8bbe
hex1a280d3f61

112341106529 has 2 divisors, whose sum is σ = 112341106530. Its totient is φ = 112341106528.

The previous prime is 112341106519. The next prime is 112341106531. The reversal of 112341106529 is 925601143211.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 110263843600 + 2077262929 = 332060^2 + 45577^2 .

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-112341106529 is a prime.

It is a Sophie Germain prime.

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

It is a Chen prime.

It is a Curzon number.

It is not a weakly prime, because it can be changed into another prime (112341106519) 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, 56170553264 + 56170553265.

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

Almost surely, 2112341106529 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 12960, while the sum is 35.

The spelling of 112341106529 in words is "one hundred twelve billion, three hundred forty-one million, one hundred six thousand, five hundred twenty-nine".