11030320313 has 2 divisors, whose sum is σ = 11030320314. Its totient is φ = 11030320312.

The previous prime is 11030320277. The next prime is 11030320331. The reversal of 11030320313 is 31302303011.

11030320313 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

Together with next prime (11030320331) it forms an Ormiston pair, because they use the same digits, order apart.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 5945489449 + 5084830864 = 77107^2 + 71308^2 .

It is a cyclic number.

It is not a de Polignac number, because 11030320313 - 2⁸ = 11030320057 is a prime.

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 = 11030320291 and 11030320300.

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

It is a pernicious number, because its binary representation contains a prime number (17) of ones.

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

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

Almost surely, 2^11030320313 is an apocalyptic number.

It is an amenable number.

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

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

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

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

Adding to 11030320313 its reverse (31302303011), we get a palindrome (42332623324).

The spelling of 11030320313 in words is "eleven billion, thirty million, three hundred twenty thousand, three hundred thirteen".