Search a number
-
+
3330250069 is a prime number
BaseRepresentation
bin1100011001111111…
…1001010101010101
322121002110020021011
43012133321111111
523310021000234
61310242452221
7145345441606
oct30637712525
98532406234
103330250069
111459926193
1278b364071
13410c44093
14238411dad
1514757ab64
hexc67f9555

3330250069 has 2 divisors, whose sum is σ = 3330250070. Its totient is φ = 3330250068.

The previous prime is 3330250057. The next prime is 3330250087. The reversal of 3330250069 is 9600520333.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 2245338225 + 1084911844 = 47385^2 + 32938^2 .

It is a cyclic number.

It is not a de Polignac number, because 3330250069 - 211 = 3330248021 is a prime.

It is a super-2 number, since 2×33302500692 = 22181131044149009522, which contains 22 as substring.

It is a self number, because there is not a number n which added to its sum of digits gives 3330250069.

It is a congruent number.

It is not a weakly prime, because it can be changed into another prime (3330250969) 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, 1665125034 + 1665125035.

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

Almost surely, 23330250069 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 14580, while the sum is 31.

The square root of 3330250069 is about 57708.3188890475. The cubic root of 3330250069 is about 1493.3408615902.

The spelling of 3330250069 in words is "three billion, three hundred thirty million, two hundred fifty thousand, sixty-nine".