Search a number
-
+
111111010033 is a prime number
BaseRepresentation
bin110011101111010111…
…0110111011011110001
3101121210111222010121211
41213132232313123301
53310023404310113
6123013234320121
711012302000522
oct1473656673361
9347714863554
10111111010033
11431382a5421
121964aa29041
13a6297340aa
14554098a849
152d54905b3d
hex19debb76f1

111111010033 has 2 divisors, whose sum is σ = 111111010034. Its totient is φ = 111111010032.

The previous prime is 111111009991. The next prime is 111111010037. The reversal of 111111010033 is 330010111111.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 102363523249 + 8747486784 = 319943^2 + 93528^2 .

It is a cyclic number.

It is not a de Polignac number, because 111111010033 - 217 = 111110878961 is a prime.

It is a super-2 number, since 2×1111110100332 (a number of 23 digits) contains 22 as substring.

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

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

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

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

Almost surely, 2111111010033 is an apocalyptic number.

It is an amenable number.

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

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

111111010033 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 13.

Adding to 111111010033 its reverse (330010111111), we get a palindrome (441121121144).

The spelling of 111111010033 in words is "one hundred eleven billion, one hundred eleven million, ten thousand, thirty-three".