Search a number
-
+
296001347249 is a prime number
BaseRepresentation
bin1000100111010110000…
…11100001111010110001
31001022000211202102101002
410103223003201322301
514322202321102444
6343551532051345
730246121636526
oct4235303417261
91038024672332
10296001347249
11104596053303
124944a303b55
1321bb358c4aa
141048005d14d
157a76602d4e
hex44eb0e1eb1

296001347249 has 2 divisors, whose sum is σ = 296001347250. Its totient is φ = 296001347248.

The previous prime is 296001347183. The next prime is 296001347251. The reversal of 296001347249 is 942743100692.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 197640706624 + 98360640625 = 444568^2 + 313625^2 .

It is a cyclic number.

It is not a de Polignac number, because 296001347249 - 220 = 296000298673 is a prime.

It is a Sophie Germain prime.

Together with 296001347251, it forms a pair of twin primes.

It is a Chen prime.

It is a Curzon number.

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

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

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

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

Almost surely, 2296001347249 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 653184, while the sum is 47.

The spelling of 296001347249 in words is "two hundred ninety-six billion, one million, three hundred forty-seven thousand, two hundred forty-nine".