Search a number
-
+
70516238713 is a prime number
BaseRepresentation
bin100000110101100011…
…0000110100101111001
320202000101202002020221
41001223012012211321
52123404124114323
652221131420041
75044313065534
oct1015306064571
9222011662227
1070516238713
11279a663a938
12117bb8b4621
13685a396b4b
1435ad3d7a1b
151c7aad555d
hex106b186979

70516238713 has 2 divisors, whose sum is σ = 70516238714. Its totient is φ = 70516238712.

The previous prime is 70516238711. The next prime is 70516238813. The reversal of 70516238713 is 31783261507.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 70345361529 + 170877184 = 265227^2 + 13072^2 .

It is a cyclic number.

It is not a de Polignac number, because 70516238713 - 21 = 70516238711 is a prime.

Together with 70516238711, it forms a pair of twin primes.

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

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

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

Almost surely, 270516238713 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 211680, while the sum is 43.

The spelling of 70516238713 in words is "seventy billion, five hundred sixteen million, two hundred thirty-eight thousand, seven hundred thirteen".