Search a number
-
+
131074727870131 is a prime number
BaseRepresentation
bin11101110011011000110110…
…100101111111111010110011
3122012002121210011002211200121
4131303120312211333322303
5114140012020313321011
61142434522042031111
736415556642653213
oct3563306645777263
9565077704084617
10131074727870131
1138845530853a81
121284b1b11a8497
13581a3a8636856
14245209d0c2243
15102484b520e71
hex77363697feb3

131074727870131 has 2 divisors, whose sum is σ = 131074727870132. Its totient is φ = 131074727870130.

The previous prime is 131074727870129. The next prime is 131074727870231. The reversal of 131074727870131 is 131078727470131.

It is a happy number.

It is a weak prime.

It is a cyclic number.

It is not a de Polignac number, because 131074727870131 - 21 = 131074727870129 is a prime.

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

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

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

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

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

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

Almost surely, 2131074727870131 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 1382976, while the sum is 52.

The spelling of 131074727870131 in words is "one hundred thirty-one trillion, seventy-four billion, seven hundred twenty-seven million, eight hundred seventy thousand, one hundred thirty-one".