Search a number
-
+
33505567013 is a prime number
BaseRepresentation
bin11111001101000101…
…100110000100100101
310012111001122011021102
4133031011212010211
51022104411121023
623220420325445
72264204422562
oct371505460445
9105431564242
1033505567013
1113234023456
1265b0b43885
13320c7305c9
14189bc55869
15d11785628
hex7cd166125

33505567013 has 2 divisors, whose sum is σ = 33505567014. Its totient is φ = 33505567012.

The previous prime is 33505566989. The next prime is 33505567021. The reversal of 33505567013 is 31076550533.

It is a happy number.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 31647698404 + 1857868609 = 177898^2 + 43103^2 .

It is a cyclic number.

It is not a de Polignac number, because 33505567013 - 212 = 33505562917 is a prime.

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

It is a Sophie Germain prime.

It is a Curzon number.

It is a congruent number.

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

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

Almost surely, 233505567013 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 141750, while the sum is 38.

The spelling of 33505567013 in words is "thirty-three billion, five hundred five million, five hundred sixty-seven thousand, thirteen".