Search a number
-
+
131044251120281 is a prime number
BaseRepresentation
bin11101110010111100011110…
…000010011011001010011001
3122011222201010011201112110122
4131302330132002123022121
5114134012111241322111
61142412521535323025
736413430463604132
oct3562743602331231
9564881104645418
10131044251120281
1138833611493804
1212845306680475
13581755c56a265
14245080b614c89
151023b65b22cdb
hex772f1e09b299

131044251120281 has 2 divisors, whose sum is σ = 131044251120282. Its totient is φ = 131044251120280.

The previous prime is 131044251120197. The next prime is 131044251120353. The reversal of 131044251120281 is 182021152440131.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 124142381286400 + 6901869833881 = 11141920^2 + 2627141^2 .

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-131044251120281 is a prime.

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

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

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

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

Almost surely, 2131044251120281 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 15360, while the sum is 35.

The spelling of 131044251120281 in words is "one hundred thirty-one trillion, forty-four billion, two hundred fifty-one million, one hundred twenty thousand, two hundred eighty-one".