Search a number
-
+
131504540437 is a prime number
BaseRepresentation
bin111101001111001001…
…0000000101100010101
3110120102202222211002201
41322132102000230111
54123310130243222
6140225022404501
712333543102424
oct1723622005425
9416382884081
10131504540437
1150852980686
12215a0730731
13c5297c664a
1465172312bb
153649ea8427
hex1e9e480b15

131504540437 has 2 divisors, whose sum is σ = 131504540438. Its totient is φ = 131504540436.

The previous prime is 131504540351. The next prime is 131504540441. The reversal of 131504540437 is 734045405131.

It is a happy number.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 131421475441 + 83064996 = 362521^2 + 9114^2 .

It is a cyclic number.

It is not a de Polignac number, because 131504540437 - 215 = 131504507669 is a prime.

It is a junction number, because it is equal to n+sod(n) for n = 131504540396 and 131504540405.

It is a congruent number.

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

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

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

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

Almost surely, 2131504540437 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 100800, while the sum is 37.

Adding to 131504540437 its reverse (734045405131), we get a palindrome (865549945568).

The spelling of 131504540437 in words is "one hundred thirty-one billion, five hundred four million, five hundred forty thousand, four hundred thirty-seven".