Search a number
-
+
111011110000013 is a prime number
BaseRepresentation
bin11001001111011011001001…
…110001110001010110001101
3112120001120002010101200111002
4121033123021301301112031
5104022301223130000023
61032033444440110045
732245200535643306
oct3117331161612615
9476046063350432
10111011110000013
113240a6025a5583
121054a844165325
1349c33c21c99b2
141d5ad75acd7ad
15cc79c14e5b28
hex64f6c9c7158d

111011110000013 has 2 divisors, whose sum is σ = 111011110000014. Its totient is φ = 111011110000012.

The previous prime is 111011110000009. The next prime is 111011110000123. The reversal of 111011110000013 is 310000011110111.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 102576424512004 + 8434685488009 = 10128002^2 + 2904253^2 .

It is a cyclic number.

It is not a de Polignac number, because 111011110000013 - 22 = 111011110000009 is a prime.

It is a junction number, because it is equal to n+sod(n) for n = 111011109999949 and 111011110000003.

It is a congruent number.

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

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

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

Almost surely, 2111011110000013 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 3, while the sum is 11.

Adding to 111011110000013 its reverse (310000011110111), we get a palindrome (421011121110124).

The spelling of 111011110000013 in words is "one hundred eleven trillion, eleven billion, one hundred ten million, thirteen", and thus it is an aban number.