Search a number
-
+
32664515306051 is a prime number
BaseRepresentation
bin1110110110101010011001…
…10101001110001001000011
311021122200211020022210011002
413123111030311032021003
513240133411404243201
6153245512101242215
76610635065656466
oct733251465161103
9137580736283132
1032664515306051
11a453a41367792
1237b672810336b
13152c334693515
1480cd845052dd
153b9a2b98a76b
hex1db54cd4e243

32664515306051 has 2 divisors, whose sum is σ = 32664515306052. Its totient is φ = 32664515306050.

The previous prime is 32664515306039. The next prime is 32664515306053. The reversal of 32664515306051 is 15060351546623.

It is a strong prime.

It is a cyclic number.

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

It is a Sophie Germain prime.

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

It is a Chen prime.

It is a junction number, because it is equal to n+sod(n) for n = 32664515305987 and 32664515306005.

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

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

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

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

Almost surely, 232664515306051 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 1944000, while the sum is 47.

The spelling of 32664515306051 in words is "thirty-two trillion, six hundred sixty-four billion, five hundred fifteen million, three hundred six thousand, fifty-one".