Search a number
-
+
3330223213 is a prime number
BaseRepresentation
bin1100011001111111…
…0010110001101101
322121002101212102111
43012133302301231
523310014120323
61310242124021
7145345300402
oct30637626155
98532355374
103330223213
111459907a99
1278b350611
13410c34aa5
142384062a9
15147572c0d
hexc67f2c6d

3330223213 has 2 divisors, whose sum is σ = 3330223214. Its totient is φ = 3330223212.

The previous prime is 3330223139. The next prime is 3330223229. The reversal of 3330223213 is 3123220333.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 2612947689 + 717275524 = 51117^2 + 26782^2 .

It is a cyclic number.

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

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

It is a congruent number.

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

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

Almost surely, 23330223213 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 1944, while the sum is 22.

The square root of 3330223213 is about 57708.0862011556. The cubic root of 3330223213 is about 1493.3368473501.

Adding to 3330223213 its reverse (3123220333), we get a palindrome (6453443546).

The spelling of 3330223213 in words is "three billion, three hundred thirty million, two hundred twenty-three thousand, two hundred thirteen".