Search a number
-
+
130931281624567 is a prime number
BaseRepresentation
bin11101110001010011010000…
…100001111111110111110111
3122011120220112010200112202211
4131301103100201333313313
5114130134231043441232
61142245000031114251
736402321133666564
oct3561232041776767
9564526463615684
10130931281624567
113879a710118606
1212827439372987
1358099c7aa94c8
142449171cc986b
151020c52eaea47
hex7714d087fdf7

130931281624567 has 2 divisors, whose sum is σ = 130931281624568. Its totient is φ = 130931281624566.

The previous prime is 130931281624543. The next prime is 130931281624607. The reversal of 130931281624567 is 765426182139031.

It is a weak prime.

It is a cyclic number.

It is not a de Polignac number, because 130931281624567 - 231 = 130929134140919 is a prime.

It is a congruent number.

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

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

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

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

It is a 1-persistent number, because it is pandigital, but 2⋅130931281624567 = 261862563249134 is not.

Almost surely, 2130931281624567 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 13063680, while the sum is 58.

The spelling of 130931281624567 in words is "one hundred thirty trillion, nine hundred thirty-one billion, two hundred eighty-one million, six hundred twenty-four thousand, five hundred sixty-seven".