Search a number
-
+
131000042403281 is a prime number
BaseRepresentation
bin11101110010010011010010…
…111111100011010111010001
3122011211111000012020000121202
4131302103102333203113101
5114132301041323401111
61142340331053200545
736410304112655312
oct3562232277432721
9564744005200552
10131000042403281
1138816895855357
1212838829190155
13581333557940c
14244c6160c2609
1510229298d8b3b
hex7724d2fe35d1

131000042403281 has 2 divisors, whose sum is σ = 131000042403282. Its totient is φ = 131000042403280.

The previous prime is 131000042403133. The next prime is 131000042403299. The reversal of 131000042403281 is 182304240000131.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 120788694332881 + 10211348070400 = 10990391^2 + 3195520^2 .

It is a cyclic number.

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

It is a super-2 number, since 2×1310000424032812 (a number of 29 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 (131000042408281) by changing a digit.

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

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

Almost surely, 2131000042403281 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 4608, while the sum is 29.

The spelling of 131000042403281 in words is "one hundred thirty-one trillion, forty-two million, four hundred three thousand, two hundred eighty-one".