Search a number
-
+
1033051332221 is a prime number
BaseRepresentation
bin11110000100001101010…
…10000101111001111101
310122202111010100001202122
433002012222011321331
5113411142120112341
62110324403132325
7134430655304126
oct17020652057175
93582433301678
101033051332221
113691295aaa97
121482669740a5
1376554878a5c
1437dddc1b04d
151bd131c394b
hexf086a85e7d

1033051332221 has 2 divisors, whose sum is σ = 1033051332222. Its totient is φ = 1033051332220.

The previous prime is 1033051332179. The next prime is 1033051332223. The reversal of 1033051332221 is 1222331503301.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 891683604100 + 141367728121 = 944290^2 + 375989^2 .

It is a cyclic number.

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

It is a super-3 number, since 3×10330513322213 (a number of 37 digits) contains 333 as substring.

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

It is a Chen prime.

It is a congruent number.

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

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

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

Almost surely, 21033051332221 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 3240, while the sum is 26.

Adding to 1033051332221 its reverse (1222331503301), we get a palindrome (2255382835522).

The spelling of 1033051332221 in words is "one trillion, thirty-three billion, fifty-one million, three hundred thirty-two thousand, two hundred twenty-one".