Search a number
-
+
6305052161 is a prime number
BaseRepresentation
bin1011101111100111…
…10111011000000001
3121021102001211120102
411313303313120001
5100403043132121
62521351052145
7312150026162
oct56763673001
917242054512
106305052161
112746046011
12127b671055
137963452c5
1443b539769
1526d7e390b
hex177cf7601

6305052161 has 2 divisors, whose sum is σ = 6305052162. Its totient is φ = 6305052160.

The previous prime is 6305052137. The next prime is 6305052167. The reversal of 6305052161 is 1612505036.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 4902100225 + 1402951936 = 70015^2 + 37456^2 .

It is a cyclic number.

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

It is a Sophie Germain prime.

It is an alternating number because its digits alternate between even and odd.

It is a Curzon number.

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

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

Almost surely, 26305052161 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 5400, while the sum is 29.

The square root of 6305052161 is about 79404.3585768439. The cubic root of 6305052161 is about 1847.4083175133.

Adding to 6305052161 its reverse (1612505036), we get a palindrome (7917557197).

The spelling of 6305052161 in words is "six billion, three hundred five million, fifty-two thousand, one hundred sixty-one".