Search a number
-
+
3301579049 is a prime number
BaseRepresentation
bin1100010011001010…
…0001100100101001
322112002111121000112
43010302201210221
523230201012144
61303340144105
7144546646616
oct30462414451
98462447015
103301579049
11144472322a
12781838035
13408015c92
142346ab50d
15144cb599e
hexc4ca1929

3301579049 has 2 divisors, whose sum is σ = 3301579050. Its totient is φ = 3301579048.

The previous prime is 3301579007. The next prime is 3301579093. The reversal of 3301579049 is 9409751033.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 3252649024 + 48930025 = 57032^2 + 6995^2 .

It is an emirp because it is prime and its reverse (9409751033) is a distict prime.

It is a cyclic number.

It is not a de Polignac number, because 3301579049 - 216 = 3301513513 is a prime.

It is a Sophie Germain prime.

It is a Curzon number.

It is a junction number, because it is equal to n+sod(n) for n = 3301578997 and 3301579015.

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

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

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

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

Almost surely, 23301579049 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 102060, while the sum is 41.

The square root of 3301579049 is about 57459.3686790936. The cubic root of 3301579049 is about 1489.0429794237.

The spelling of 3301579049 in words is "three billion, three hundred one million, five hundred seventy-nine thousand, forty-nine".