Search a number
-
+
5034311143157 is a prime number
BaseRepresentation
bin100100101000010010001…
…0100111100111011110101
3122211021102210120210102002
41021100210110330323311
51124440232123040112
614412421451225045
71026500631444362
oct111204424747365
918737383523362
105034311143157
11167104843a21a
12693824748185
132a696c67a83a
1413593a5b9469
158ae49a811c2
hex4942453cef5

5034311143157 has 2 divisors, whose sum is σ = 5034311143158. Its totient is φ = 5034311143156.

The previous prime is 5034311143151. The next prime is 5034311143171. The reversal of 5034311143157 is 7513411134305.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 5016565173361 + 17745969796 = 2239769^2 + 133214^2 .

It is a cyclic number.

It is not a de Polignac number, because 5034311143157 - 226 = 5034244034293 is a prime.

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

It is a self number, because there is not a number n which added to its sum of digits gives 5034311143157.

It is a congruent number.

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

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

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

Almost surely, 25034311143157 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The spelling of 5034311143157 in words is "five trillion, thirty-four billion, three hundred eleven million, one hundred forty-three thousand, one hundred fifty-seven".