Search a number
-
+
111022010120009 is a prime number
BaseRepresentation
bin11001001111100101010011…
…011110011011011101001001
3112120002121012202220011010002
4121033211103132123131021
5104022441034042320014
61032042450215332345
732246034623303642
oct3117452336333511
9476077182804102
10111022010120009
113241419641400a
12105509866810b5
1349c443b523341
141d5b6cb6006c9
15cc7e0d405dde
hex64f95379b749

111022010120009 has 2 divisors, whose sum is σ = 111022010120010. Its totient is φ = 111022010120008.

The previous prime is 111022010119967. The next prime is 111022010120011. The reversal of 111022010120009 is 900021010220111.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 91370122147984 + 19651887972025 = 9558772^2 + 4433045^2 .

It is a cyclic number.

It is not a de Polignac number, because 111022010120009 - 28 = 111022010119753 is a prime.

It is a Sophie Germain prime.

Together with 111022010120011, it forms a pair of twin primes.

It is a Chen prime.

It is a Curzon number.

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

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

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

Almost surely, 2111022010120009 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The spelling of 111022010120009 in words is "one hundred eleven trillion, twenty-two billion, ten million, one hundred twenty thousand, nine".