Search a number
-
+
5011056106141 is a prime number
BaseRepresentation
bin100100011101011101000…
…1110000001101010011101
3122202001102010010111210211
41020322322032001222131
51124100120330344031
614354014123132421
71025015433053551
oct110727216015235
918661363114724
105011056106141
1116621a4596768
1268b214674111
132a47048043c7
14134771c9d861
158a538194bb1
hex48eba381a9d

5011056106141 has 2 divisors, whose sum is σ = 5011056106142. Its totient is φ = 5011056106140.

The previous prime is 5011056106123. The next prime is 5011056106157. The reversal of 5011056106141 is 1416016501105.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 4582044206041 + 429011900100 = 2140571^2 + 654990^2 .

It is a cyclic number.

It is not a de Polignac number, because 5011056106141 - 225 = 5011022551709 is a prime.

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

It is a congruent number.

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

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

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

Almost surely, 25011056106141 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 3600, while the sum is 31.

The spelling of 5011056106141 in words is "five trillion, eleven billion, fifty-six million, one hundred six thousand, one hundred forty-one".