Search a number
-
+
111111110111009 is a prime number
BaseRepresentation
bin11001010000111000010010…
…001111111010111100100001
3112120102010012022020122222202
4121100320102033322330201
5104030421023142023014
61032151423405342545
732255340613603361
oct3120702217727441
9476363168218882
10111111110111009
1132448a58aa7008
12105660b1b67a55
1349cc96aa47ac8
141d61b40b7c9a1
15cca3c57533de
hex650e123faf21

111111110111009 has 2 divisors, whose sum is σ = 111111110111010. Its totient is φ = 111111110111008.

The previous prime is 111111110110981. The next prime is 111111110111093. The reversal of 111111110111009 is 900111011111111.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 102786586810384 + 8324523300625 = 10138372^2 + 2885225^2 .

It is a cyclic number.

It is not a de Polignac number, because 111111110111009 - 216 = 111111110045473 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 (111111110111509) 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, 55555555055504 + 55555555055505.

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

Almost surely, 2111111110111009 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The spelling of 111111110111009 in words is "one hundred eleven trillion, one hundred eleven billion, one hundred ten million, one hundred eleven thousand, nine".