Search a number
-
+
111100091153 is a prime number
BaseRepresentation
bin110011101111000010…
…1001101101100010001
3101121202202102101201212
41213132011031230101
53310013110404103
6123012204305505
711012110123202
oct1473605155421
9347682371655
10111100091153
1143132117957
1219647242295
13a6273b020c
14553d3475a9
152d5399a7d8
hex19de14db11

111100091153 has 2 divisors, whose sum is σ = 111100091154. Its totient is φ = 111100091152.

The previous prime is 111100091101. The next prime is 111100091171. The reversal of 111100091153 is 351190001111.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 81511963009 + 29588128144 = 285503^2 + 172012^2 .

It is a cyclic number.

It is not a de Polignac number, because 111100091153 - 226 = 111032982289 is a prime.

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 (111100094153) by changing a digit.

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

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

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

Almost surely, 2111100091153 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 135, while the sum is 23.

Adding to 111100091153 its reverse (351190001111), we get a palindrome (462290092264).

The spelling of 111100091153 in words is "one hundred eleven billion, one hundred million, ninety-one thousand, one hundred fifty-three".