Search a number
-
+
131141123509133 is a prime number
BaseRepresentation
bin11101110100010110101100…
…000101010000101110001101
3122012022222011101012202210102
4131310112230011100232031
5114142104010104243013
61142525222255020445
736423430202405603
oct3564265405205615
9565288141182712
10131141123509133
1138870702419301
1212860040b0a725
13582372a1050ca
14245539b131873
1510264354acd58
hex7745ac150b8d

131141123509133 has 2 divisors, whose sum is σ = 131141123509134. Its totient is φ = 131141123509132.

The previous prime is 131141123509079. The next prime is 131141123509159. The reversal of 131141123509133 is 331905321141131.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 74548408076164 + 56592715432969 = 8634142^2 + 7522813^2 .

It is a cyclic number.

It is not a de Polignac number, because 131141123509133 - 212 = 131141123505037 is a prime.

It is a congruent number.

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

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

Almost surely, 2131141123509133 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The spelling of 131141123509133 in words is "one hundred thirty-one trillion, one hundred forty-one billion, one hundred twenty-three million, five hundred nine thousand, one hundred thirty-three".