Search a number
-
+
131121121023173 is a prime number
BaseRepresentation
bin11101110100000100000011…
…110101110101010011000101
3122012021001112101000012110002
4131310010003311311103011
5114141242023440220143
61142512113400211045
736422121420156161
oct3564040365652305
9565231471005402
10131121121023173
1138863178551576
121285819a169a85
135821890069ab8
14245442079dca1
151025b644005b8
hex774103d754c5

131121121023173 has 2 divisors, whose sum is σ = 131121121023174. Its totient is φ = 131121121023172.

The previous prime is 131121121023133. The next prime is 131121121023209. The reversal of 131121121023173 is 371320121121131.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 84522244185604 + 46598876837569 = 9193598^2 + 6826337^2 .

It is a cyclic number.

It is not a de Polignac number, because 131121121023173 - 222 = 131121116828869 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 (131121121023133) 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, 65560560511586 + 65560560511587.

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

Almost surely, 2131121121023173 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 1512, while the sum is 29.

The spelling of 131121121023173 in words is "one hundred thirty-one trillion, one hundred twenty-one billion, one hundred twenty-one million, twenty-three thousand, one hundred seventy-three".