Search a number
-
+
111000111010093 is a prime number
BaseRepresentation
bin11001001111010000111010…
…001011111101000100101101
3112120000111200120212002211001
4121033100322023331010231
5104022111211404310333
61032024425205400301
732244331141035304
oct3117207213750455
9476014616762731
10111000111010093
1132405978997668
1210548694709091
1349c235b567036
141d5a61100343b
15cc757aaa5b7d
hex64f43a2fd12d

111000111010093 has 2 divisors, whose sum is σ = 111000111010094. Its totient is φ = 111000111010092.

The previous prime is 111000111010079. The next prime is 111000111010109. The reversal of 111000111010093 is 390010111000111.

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., 108264586870729 + 2735524139364 = 10405027^2 + 1653942^2 .

It is a cyclic number.

It is not a de Polignac number, because 111000111010093 - 225 = 111000077455661 is a prime.

It is a self number, because there is not a number n which added to its sum of digits gives 111000111010093.

It is a congruent number.

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

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

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

Almost surely, 2111000111010093 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 27, while the sum is 19.

The spelling of 111000111010093 in words is "one hundred eleven trillion, one hundred eleven million, ten thousand, ninety-three".