Search a number
-
+
111051011060113 is a prime number
BaseRepresentation
bin11001010000000000010100…
…000100001111000110010001
3112120012101001220021112221211
4121100000110010033012101
5104023424432312410423
61032104044042220121
732251112402235505
oct3120002404170621
9476171056245854
10111051011060113
1132425518716603
121055651aab4641
1349c70b091a127
141d5cc7d0a4305
15cc8a5948710d
hex65001410f191

111051011060113 has 2 divisors, whose sum is σ = 111051011060114. Its totient is φ = 111051011060112.

The previous prime is 111051011060081. The next prime is 111051011060131. The reversal of 111051011060113 is 311060110150111.

Together with next prime (111051011060131) it forms an Ormiston pair, because they use the same digits, order apart.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 108545809035024 + 2505202025089 = 10418532^2 + 1582783^2 .

It is a cyclic number.

It is not a de Polignac number, because 111051011060113 - 25 = 111051011060081 is a prime.

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

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

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

Almost surely, 2111051011060113 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 90, while the sum is 22.

The spelling of 111051011060113 in words is "one hundred eleven trillion, fifty-one billion, eleven million, sixty thousand, one hundred thirteen".