Search a number
-
+
1033022119981 is a prime number
BaseRepresentation
bin11110000100001001110…
…10101010000000101101
310122202102002100221002211
433002010322222000231
5113411112130314411
62110321441050421
7134430152066215
oct17020472520055
93582362327084
101033022119981
11369114068445
12148259026a11
137654b7bb4c7
1437dd9db5245
151bd10853221
hexf084eaa02d

1033022119981 has 2 divisors, whose sum is σ = 1033022119982. Its totient is φ = 1033022119980.

The previous prime is 1033022119967. The next prime is 1033022120027. The reversal of 1033022119981 is 1899112203301.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 881129529225 + 151892590756 = 938685^2 + 389734^2 .

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

It is a cyclic number.

It is not a de Polignac number, because 1033022119981 - 25 = 1033022119949 is a prime.

It is a super-2 number, since 2×10330221199812 (a number of 25 digits) contains 22 as substring.

It is a congruent number.

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

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

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

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

Almost surely, 21033022119981 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 23328, while the sum is 40.

The spelling of 1033022119981 in words is "one trillion, thirty-three billion, twenty-two million, one hundred nineteen thousand, nine hundred eighty-one".