Search a number
-
+
57074063692801 is a prime number
BaseRepresentation
bin11001111101000100101110…
…10010101101010000000001
321111002020010122000122221111
430332202113102231100001
524440100140301132201
6321215243552523321
715010315334612011
oct1476422722552001
9244066118018844
1057074063692801
1117204a7a045001
126499404550541
1325b00a43583ac
141014584029c41
1568e9625c6b51
hex33e8974ad401

57074063692801 has 2 divisors, whose sum is σ = 57074063692802. Its totient is φ = 57074063692800.

The previous prime is 57074063692753. The next prime is 57074063692817. The reversal of 57074063692801 is 10829636047075.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 31972510771776 + 25101552921025 = 5654424^2 + 5010145^2 .

It is a cyclic number.

It is not a de Polignac number, because 57074063692801 - 213 = 57074063684609 is a prime.

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

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

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

It is a 1-persistent number, because it is pandigital, but 2⋅57074063692801 = 114148127385602 is not.

Almost surely, 257074063692801 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 15240960, while the sum is 58.

The spelling of 57074063692801 in words is "fifty-seven trillion, seventy-four billion, sixty-three million, six hundred ninety-two thousand, eight hundred one".