Search a number
-
+
111011001001013 is a prime number
BaseRepresentation
bin11001001111011011000011…
…010001111110010000110101
3112120001112210112021221222002
4121033123003101332100311
5104022301012224013023
61032033425543545045
732245165043321051
oct3117330321762065
9476045715257862
10111011001001013
113240a557017a63
121054a81375b185
1349c33a5755149
141d5ad65438c61
15cc79b6b64b28
hex64f6c347e435

111011001001013 has 2 divisors, whose sum is σ = 111011001001014. Its totient is φ = 111011001001012.

The previous prime is 111011001000983. The next prime is 111011001001039. The reversal of 111011001001013 is 310100100110111.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 100418176266769 + 10592824734244 = 10020887^2 + 3254662^2 .

It is a cyclic number.

It is not a de Polignac number, because 111011001001013 - 210 = 111011000999989 is a prime.

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

It is a congruent number.

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

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

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

Almost surely, 2111011001001013 is an apocalyptic number.

It is an amenable number.

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

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

111011001001013 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 111011001001013 its reverse (310100100110111), we get a palindrome (421111101111124).

The spelling of 111011001001013 in words is "one hundred eleven trillion, eleven billion, one million, one thousand, thirteen".