Search a number
-
+
131010013061 is a prime number
BaseRepresentation
bin111101000000011001…
…1100010011110000101
3110112011022110020001222
41322000303202132011
54121302030404221
6140103555130125
712315356510564
oct1720063423605
9415138406058
10131010013061
1150619811974
1221482ba3945
13c47b2094b5
1464ab6a1bdb
15361b8719ab
hex1e80ce2785

131010013061 has 2 divisors, whose sum is σ = 131010013062. Its totient is φ = 131010013060.

The previous prime is 131010013039. The next prime is 131010013063. The reversal of 131010013061 is 160310010131.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 102922264225 + 28087748836 = 320815^2 + 167594^2 .

It is a cyclic number.

It is not a de Polignac number, because 131010013061 - 230 = 129936271237 is a prime.

Together with 131010013063, it forms a pair of twin primes.

It is a Chen prime.

It is a congruent number.

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

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

Almost surely, 2131010013061 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 54, while the sum is 17.

Adding to 131010013061 its reverse (160310010131), we get a palindrome (291320023192).

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