Search a number
-
+
110312001300013 is a prime number
BaseRepresentation
bin11001000101010000000011…
…101001101110011000101101
3112110120201120001001000111021
4121011100003221232120231
5103424322434313100023
61030340344522254141
732143531141022122
oct3105200351563055
9473521501030437
10110312001300013
11321700699a6857
1210457256057351
1349724b95cb506
141d351b4d1c749
15cb47057ec35d
hex645403a6e62d

110312001300013 has 2 divisors, whose sum is σ = 110312001300014. Its totient is φ = 110312001300012.

The previous prime is 110312001299917. The next prime is 110312001300019. The reversal of 110312001300013 is 310003100213011.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 85758212288329 + 24553789011684 = 9260573^2 + 4955178^2 .

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-110312001300013 is a prime.

It is a self number, because there is not a number n which added to its sum of digits gives 110312001300013.

It is a congruent number.

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

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

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

Almost surely, 2110312001300013 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 54, while the sum is 16.

Adding to 110312001300013 its reverse (310003100213011), we get a palindrome (420315101513024).

The spelling of 110312001300013 in words is "one hundred ten trillion, three hundred twelve billion, one million, three hundred thousand, thirteen".