Search a number
-
+
111023030213 is a prime number
BaseRepresentation
bin110011101100101111…
…1001111111111000101
3101121120101102021222222
41213121133033333011
53304333343431323
6123000412502125
711010153120554
oct1473137177705
9347511367888
10111023030213
11430a2673927
121962547a945
13a61443b824
145533007d9b
152d4bd279c8
hex19d97cffc5

111023030213 has 2 divisors, whose sum is σ = 111023030214. Its totient is φ = 111023030212.

The previous prime is 111023030159. The next prime is 111023030257. The reversal of 111023030213 is 312030320111.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 106098078529 + 4924951684 = 325727^2 + 70178^2 .

It is a cyclic number.

It is not a de Polignac number, because 111023030213 - 210 = 111023029189 is a prime.

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

It is a Sophie Germain prime.

It is a Curzon number.

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

It is a congruent number.

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

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

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

Almost surely, 2111023030213 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 108, while the sum is 17.

Adding to 111023030213 its reverse (312030320111), we get a palindrome (423053350324).

The spelling of 111023030213 in words is "one hundred eleven billion, twenty-three million, thirty thousand, two hundred thirteen".