Search a number
-
+
71270251533461 is a prime number
BaseRepresentation
bin10000001101000111100110…
…000001101001010010010101
3100100100100222100222112200202
4100031013212001221102111
533320142433343032321
6411325033534150245
721004051162355321
oct2015074601512225
9310310870875622
1071270251533461
11207885a8a85082
127bb079b052385
13309c9a9897706
1413856da160981
15838d81e2a70b
hex40d1e6069495

71270251533461 has 2 divisors, whose sum is σ = 71270251533462. Its totient is φ = 71270251533460.

The previous prime is 71270251533409. The next prime is 71270251533463. The reversal of 71270251533461 is 16433515207217.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 35673742562500 + 35596508970961 = 5972750^2 + 5966281^2 .

It is a cyclic number.

It is not a de Polignac number, because 71270251533461 - 210 = 71270251532437 is a prime.

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

It is a Chen prime.

It is a congruent number.

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

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

Almost surely, 271270251533461 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 1058400, while the sum is 47.

The spelling of 71270251533461 in words is "seventy-one trillion, two hundred seventy billion, two hundred fifty-one million, five hundred thirty-three thousand, four hundred sixty-one".