Search a number
-
+
390131004112141 is a prime number
BaseRepresentation
bin101100010110100100111001…
…1111010100111110100001101
31220011100011022110101021211211
41120231021303322213310031
5402113401244023042031
63501423413054414421
7145114014653661025
oct13055116372476415
91804304273337754
10390131004112141
111033426a2144056
123790a003b01411
131398c271313b66
146c4a6270c2a85
153018309293bb1
hex162d273ea7d0d

390131004112141 has 2 divisors, whose sum is σ = 390131004112142. Its totient is φ = 390131004112140.

The previous prime is 390131004112133. The next prime is 390131004112207. The reversal of 390131004112141 is 141211400131093.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 387765175596516 + 2365828515625 = 19691754^2 + 1538125^2 .

It is an emirp because it is prime and its reverse (141211400131093) is a distict prime.

It is a cyclic number.

It is not a de Polignac number, because 390131004112141 - 23 = 390131004112133 is a prime.

It is a congruent number.

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

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

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

Almost surely, 2390131004112141 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The spelling of 390131004112141 in words is "three hundred ninety trillion, one hundred thirty-one billion, four million, one hundred twelve thousand, one hundred forty-one".