Search a number
-
+
131000042401069 is a prime number
BaseRepresentation
bin11101110010010011010010…
…111111100010110100101101
3122011211111000012012220120211
4131302103102333202310231
5114132301041323313234
61142340331053142421
736410304112646002
oct3562232277426455
9564744005186524
10131000042401069
1138816895853726
121283882918aa11
1358133355783ca
14244c6160c18a9
1510229298d8164
hex7724d2fe2d2d

131000042401069 has 2 divisors, whose sum is σ = 131000042401070. Its totient is φ = 131000042401068.

The previous prime is 131000042401061. The next prime is 131000042401141. The reversal of 131000042401069 is 960104240000131.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 129959703600169 + 1040338800900 = 11399987^2 + 1019970^2 .

It is a cyclic number.

It is not a de Polignac number, because 131000042401069 - 23 = 131000042401061 is a prime.

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

It is a self number, because there is not a number n which added to its sum of digits gives 131000042401069.

It is a congruent number.

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

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

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

Almost surely, 2131000042401069 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 5184, while the sum is 31.

The spelling of 131000042401069 in words is "one hundred thirty-one trillion, forty-two million, four hundred one thousand, sixty-nine".