Search a number
-
+
5321514457001 is a prime number
BaseRepresentation
bin100110101110000001011…
…1110101001011110101001
3200211201202111021210212002
41031130002332221132221
51144141430200111001
615152400415100345
71056316042361111
oct115340276513651
920751674253762
105321514457001
1117719291a7836
1271b4185116b5
132c7a802821b2
141457c3d98041
1593658a9e46b
hex4d702fa97a9

5321514457001 has 2 divisors, whose sum is σ = 5321514457002. Its totient is φ = 5321514457000.

The previous prime is 5321514456949. The next prime is 5321514457013. The reversal of 5321514457001 is 1007544151235.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 4498047139600 + 823467317401 = 2120860^2 + 907451^2 .

It is a cyclic number.

It is not a de Polignac number, because 5321514457001 - 222 = 5321510262697 is a prime.

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

It is a Sophie Germain prime.

It is a Curzon number.

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

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

Almost surely, 25321514457001 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 84000, while the sum is 38.

The spelling of 5321514457001 in words is "five trillion, three hundred twenty-one billion, five hundred fourteen million, four hundred fifty-seven thousand, one".