Search a number
-
+
57904725029363 is a prime number
BaseRepresentation
bin11010010101001111111101…
…00100001111000111110011
321121000122012211212200111222
431022213332210033013303
530042202334101414423
6323053021412055255
715124323031513562
oct1512477644170763
9247018184780458
1057904725029363
11174a528a784773
1265b23a730452b
1326405136bcb64
14104286458bbd9
156a637c5c93c8
hex34a9fe90f1f3

57904725029363 has 2 divisors, whose sum is σ = 57904725029364. Its totient is φ = 57904725029362.

The previous prime is 57904725029299. The next prime is 57904725029369. The reversal of 57904725029363 is 36392052740975.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 57904725029363 - 26 = 57904725029299 is a prime.

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

It is a Sophie Germain prime.

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

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

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

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

Almost surely, 257904725029363 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 85730400, while the sum is 62.

The spelling of 57904725029363 in words is "fifty-seven trillion, nine hundred four billion, seven hundred twenty-five million, twenty-nine thousand, three hundred sixty-three".