Search a number
-
+
131044251502573 is a prime number
BaseRepresentation
bin11101110010111100011110…
…000011111000011111101101
3122011222201010012102221212121
4131302330132003320133231
5114134012111341040243
61142412521551432541
736413430500055523
oct3562743603703755
9564881105387777
10131044251502573
1138833611724a52
1212845306825751
13581755c672276
14245080b6b4313
151023b65b9b1ed
hex772f1e0f87ed

131044251502573 has 2 divisors, whose sum is σ = 131044251502574. Its totient is φ = 131044251502572.

The previous prime is 131044251502553. The next prime is 131044251502603. The reversal of 131044251502573 is 375205152440131.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 108997817800804 + 22046433701769 = 10440202^2 + 4695363^2 .

It is a cyclic number.

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

It is a congruent number.

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

It is a pernicious number, because its binary representation contains a prime number (29) of ones.

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

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

Almost surely, 2131044251502573 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 504000, while the sum is 43.

The spelling of 131044251502573 in words is "one hundred thirty-one trillion, forty-four billion, two hundred fifty-one million, five hundred two thousand, five hundred seventy-three".