Search a number
-
+
131073954881 is a prime number
BaseRepresentation
bin111101000010010011…
…1011101010001000001
3110112022202202210202112
41322010213131101001
54121414413024011
6140114201425105
712320064143102
oct1720447352101
9415282683675
10131073954881
1150651915351
12214a049b195
13c48b5366ac
1464b5d883a9
1536222a258b
hex1e849dd441

131073954881 has 2 divisors, whose sum is σ = 131073954882. Its totient is φ = 131073954880.

The previous prime is 131073954859. The next prime is 131073954929. The reversal of 131073954881 is 188459370131.

It is a happy number.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 77738361856 + 53335593025 = 278816^2 + 230945^2 .

It is a cyclic number.

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

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

It is a Sophie Germain prime.

It is a Curzon number.

It is not a weakly prime, because it can be changed into another prime (131073954181) 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, 65536977440 + 65536977441.

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

Almost surely, 2131073954881 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 725760, while the sum is 50.

The spelling of 131073954881 in words is "one hundred thirty-one billion, seventy-three million, nine hundred fifty-four thousand, eight hundred eighty-one".