Search a number
-
+
131000321402569 is a prime number
BaseRepresentation
bin11101110010010011100011…
…100111110110011011001001
3122011211111201122012122200201
4131302103203213312123021
5114132302124234340234
61142340414501132201
736410314041300313
oct3562234347663311
9564744648178621
10131000321402569
1138816a19295683
12128388a66ba061
13581337b303458
14244c64118a7b3
15102294414a314
hex7724e39f66c9

131000321402569 has 2 divisors, whose sum is σ = 131000321402570. Its totient is φ = 131000321402568.

The previous prime is 131000321402563. The next prime is 131000321402593. The reversal of 131000321402569 is 965204123000131.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 127143665640000 + 3856655762569 = 11275800^2 + 1963837^2 .

It is a cyclic number.

It is not a de Polignac number, because 131000321402569 - 25 = 131000321402537 is a prime.

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

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

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

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

Almost surely, 2131000321402569 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 38880, while the sum is 37.

The spelling of 131000321402569 in words is "one hundred thirty-one trillion, three hundred twenty-one million, four hundred two thousand, five hundred sixty-nine".