Search a number
-
+
131001961913 is a prime number
BaseRepresentation
bin111101000000001010…
…0110100110110111001
3110112010202022011222022
41322000110310312321
54121243000240123
6140103110404225
712315231206054
oct1720024646671
9415122264868
10131001961913
1150615212a29
1221480360675
13c47964a9c4
1464aa5a7a9b
15361acd11c8
hex1e80534db9

131001961913 has 2 divisors, whose sum is σ = 131001961914. Its totient is φ = 131001961912.

The previous prime is 131001961819. The next prime is 131001961931. The reversal of 131001961913 is 319169100131.

Together with next prime (131001961931) it forms an Ormiston pair, because they use the same digits, order apart.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 130113146944 + 888814969 = 360712^2 + 29813^2 .

It is a cyclic number.

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

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

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

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

Almost surely, 2131001961913 is an apocalyptic number.

It is an amenable number.

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

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

131001961913 is an evil number, because the sum of its binary digits is even.

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

The spelling of 131001961913 in words is "one hundred thirty-one billion, one million, nine hundred sixty-one thousand, nine hundred thirteen".