Search a number
-
+
311013123313 is a prime number
BaseRepresentation
bin1001000011010011101…
…00111010010011110001
31002201210001001122210011
410201221310322103301
520043423324421223
6354513310334521
731320123633514
oct4415164722361
91081701048704
10311013123313
1110a999888902
12503397ba441
132343669c619
14110a5a6ad7b
15815449180d
hex4869d3a4f1

311013123313 has 2 divisors, whose sum is σ = 311013123314. Its totient is φ = 311013123312.

The previous prime is 311013123301. The next prime is 311013123331. The reversal of 311013123313 is 313321310113.

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

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 301470177969 + 9542945344 = 549063^2 + 97688^2 .

It is a cyclic number.

It is not a de Polignac number, because 311013123313 - 237 = 173574169841 is a prime.

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

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

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

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

Almost surely, 2311013123313 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 486, while the sum is 22.

Adding to 311013123313 its reverse (313321310113), we get a palindrome (624334433426).

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