Search a number
-
+
71520739057 is a prime number
BaseRepresentation
bin100001010011011110…
…1111101111011110001
320211121101212222200101
41002212331331323301
52132433302122212
652504533352401
75111231152135
oct1024675757361
9224541788611
1071520739057
1128371657909
1211a40198701
13698a51b551
1436669973c5
151cd8da5157
hex10a6f7def1

71520739057 has 2 divisors, whose sum is σ = 71520739058. Its totient is φ = 71520739056.

The previous prime is 71520739051. The next prime is 71520739093. The reversal of 71520739057 is 75093702517.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 69818021361 + 1702717696 = 264231^2 + 41264^2 .

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

It is a cyclic number.

It is not a de Polignac number, because 71520739057 - 27 = 71520738929 is a prime.

It is a super-2 number, since 2×715207390572 (a number of 23 digits) contains 22 as substring.

It is a junction number, because it is equal to n+sod(n) for n = 71520738998 and 71520739016.

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

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

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

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

Almost surely, 271520739057 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 463050, while the sum is 46.

The spelling of 71520739057 in words is "seventy-one billion, five hundred twenty million, seven hundred thirty-nine thousand, fifty-seven".