Search a number
-
+
3110130300713 is a prime number
BaseRepresentation
bin101101010000100010001…
…101100011011100101001
3102000022210022212012210112
4231100202031203130221
5401424021324110323
610340435114024105
7440461633240022
oct55204215433451
912008708765715
103110130300713
11a99aa9523727
12422920418035
1319739001c407
14aa761517c49
1555d7cec9178
hex2d422363729

3110130300713 has 2 divisors, whose sum is σ = 3110130300714. Its totient is φ = 3110130300712.

The previous prime is 3110130300707. The next prime is 3110130300743. The reversal of 3110130300713 is 3170030310113.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 1666172384809 + 1443957915904 = 1290803^2 + 1201648^2 .

It is an emirp because it is prime and its reverse (3170030310113) is a distict prime.

It is a cyclic number.

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

It is not a weakly prime, because it can be changed into another prime (3110130300743) 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, 1555065150356 + 1555065150357.

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

Almost surely, 23110130300713 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 567, while the sum is 23.

Adding to 3110130300713 its reverse (3170030310113), we get a palindrome (6280160610826).

The spelling of 3110130300713 in words is "three trillion, one hundred ten billion, one hundred thirty million, three hundred thousand, seven hundred thirteen".