Search a number
-
+
33641371013 is a prime number
BaseRepresentation
bin11111010101001011…
…101001010110000101
310012211112011201100012
4133111023221112011
51022344142333023
623242111200005
72300443635605
oct372513512605
9105745151305
1033641371013
11132a3749a68
12662a516005
1332318cbac3
1418b1cc6c05
15d1d65d978
hex7d52e9585

33641371013 has 2 divisors, whose sum is σ = 33641371014. Its totient is φ = 33641371012.

The previous prime is 33641371007. The next prime is 33641371067. The reversal of 33641371013 is 31017314633.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 23500276804 + 10141094209 = 153298^2 + 100703^2 .

It is a cyclic number.

It is not a de Polignac number, because 33641371013 - 220 = 33640322437 is a prime.

It is a super-2 number, since 2×336413710132 (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 (33641371003) 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, 16820685506 + 16820685507.

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

Almost surely, 233641371013 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 13608, while the sum is 32.

Adding to 33641371013 its reverse (31017314633), we get a palindrome (64658685646).

The spelling of 33641371013 in words is "thirty-three billion, six hundred forty-one million, three hundred seventy-one thousand, thirteen".