Search a number
-
+
2304871389641 is a prime number
BaseRepresentation
bin100001100010100101000…
…010100101100111001001
322011100021110011010000202
4201202211002211213021
5300230334033432031
64522502052541545
7325343601362522
oct41424502454711
98140243133022
102304871389641
118095438a2237
123128489218b5
1313946b6a1752
147d7b0975849
153ee4d18b2cb
hex218a50a59c9

2304871389641 has 2 divisors, whose sum is σ = 2304871389642. Its totient is φ = 2304871389640.

The previous prime is 2304871389599. The next prime is 2304871389679. The reversal of 2304871389641 is 1469831784032.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 2000586765241 + 304284624400 = 1414421^2 + 551620^2 .

It is a cyclic number.

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

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 (2304871389241) by changing a digit.

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

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

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

Almost surely, 22304871389641 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 6967296, while the sum is 56.

The spelling of 2304871389641 in words is "two trillion, three hundred four billion, eight hundred seventy-one million, three hundred eighty-nine thousand, six hundred forty-one".