Search a number
-
+
5042311543253 is a prime number
BaseRepresentation
bin100100101100000000100…
…1100000011100111010101
3122212001002100202020010202
41021120001030003213111
51130103123223341003
614420223403430245
71030203115642115
oct111300114034725
918761070666122
105042311543253
111674483460226
12695297b25385
132a7646000aaa
14136098d49045
158b26710a088
hex496013039d5

5042311543253 has 2 divisors, whose sum is σ = 5042311543254. Its totient is φ = 5042311543252.

The previous prime is 5042311543237. The next prime is 5042311543259. The reversal of 5042311543253 is 3523451132405.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 2864024829649 + 2178286713604 = 1692343^2 + 1475902^2 .

It is a cyclic number.

It is not a de Polignac number, because 5042311543253 - 24 = 5042311543237 is a prime.

It is a Sophie Germain prime.

It is a Curzon number.

It is a congruent number.

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

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

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

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

Almost surely, 25042311543253 is an apocalyptic number.

It is an amenable number.

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

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

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

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

Adding to 5042311543253 its reverse (3523451132405), we get a palindrome (8565762675658).

The spelling of 5042311543253 in words is "five trillion, forty-two billion, three hundred eleven million, five hundred forty-three thousand, two hundred fifty-three".