Search a number
-
+
33333321041 is a prime number
BaseRepresentation
bin11111000010110100…
…100001110101010001
310012001001112011012222
4133002310201311101
51021231312233131
623151344430425
72260013360666
oct370264416521
9105031464188
1033333321041
1113155877509
126563318415
1331b2b42c07
141883019a6d
15d015ae87b
hex7c2d21d51

33333321041 has 2 divisors, whose sum is σ = 33333321042. Its totient is φ = 33333321040.

The previous prime is 33333320971. The next prime is 33333321097. The reversal of 33333321041 is 14012333333.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 31646986816 + 1686334225 = 177896^2 + 41065^2 .

It is a cyclic number.

It is not a de Polignac number, because 33333321041 - 218 = 33333058897 is a prime.

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

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

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

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

Almost surely, 233333321041 is an apocalyptic number.

It is an amenable number.

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

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

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

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

Adding to 33333321041 its reverse (14012333333), we get a palindrome (47345654374).

The spelling of 33333321041 in words is "thirty-three billion, three hundred thirty-three million, three hundred twenty-one thousand, forty-one".