Search a number
-
+
111023032313 is a prime number
BaseRepresentation
bin110011101100101111…
…1010000011111111001
3101121120101102101212202
41213121133100133321
53304333344013223
6123000412515545
711010153126644
oct1473137203771
9347511371782
10111023032313
11430a2675466
121962547bbb5
13a61443c77b
145533008a5b
152d4bd28428
hex19d97d07f9

111023032313 has 2 divisors, whose sum is σ = 111023032314. Its totient is φ = 111023032312.

The previous prime is 111023032283. The next prime is 111023032357. The reversal of 111023032313 is 313230320111.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 102343687744 + 8679344569 = 319912^2 + 93163^2 .

It is a cyclic number.

It is not a de Polignac number, because 111023032313 - 216 = 111022966777 is a prime.

It is a super-2 number, since 2×1110230323132 (a number of 23 digits) contains 22 as substring.

It is a Sophie Germain prime.

It is a Curzon number.

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

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

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

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

Almost surely, 2111023032313 is an apocalyptic number.

It is an amenable number.

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

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

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

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

Adding to 111023032313 its reverse (313230320111), we get a palindrome (424253352424).

The spelling of 111023032313 in words is "one hundred eleven billion, twenty-three million, thirty-two thousand, three hundred thirteen".