Search a number
-
+
111011120100137 is a prime number
BaseRepresentation
bin11001001111011011001010…
…011000010011001100101001
3112120001120002211101211020202
4121033123022120103030221
5104022301233221201022
61032033445440401545
732245201020540605
oct3117331230231451
9476046084354222
10111011120100137
113240a608273994
121054a8476162b5
1349c33c4324cba
141d5ad7719c505
15cc79c233d592
hex64f6ca613329

111011120100137 has 2 divisors, whose sum is σ = 111011120100138. Its totient is φ = 111011120100136.

The previous prime is 111011120100119. The next prime is 111011120100161. The reversal of 111011120100137 is 731001021110111.

It is a happy number.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 66028934420761 + 44982185679376 = 8125819^2 + 6706876^2 .

It is a cyclic number.

It is not a de Polignac number, because 111011120100137 - 28 = 111011120099881 is a prime.

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

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

Almost surely, 2111011120100137 is an apocalyptic number.

It is an amenable number.

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

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

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

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

Adding to 111011120100137 its reverse (731001021110111), we get a palindrome (842012141210248).

The spelling of 111011120100137 in words is "one hundred eleven trillion, eleven billion, one hundred twenty million, one hundred thousand, one hundred thirty-seven".