Search a number
-
+
3301302132031 is a prime number
BaseRepresentation
bin110000000010100100111…
…100001101110100111111
3102200121020102101110112111
4300002210330031310333
5413042031321211111
611004333001514451
7460340226056641
oct60024474156477
912617212343474
103301302132031
11106308aa97052
124539934a2a27
131ac408362027
14b5ad8d52891
155ad1b3b4a21
hex300a4f0dd3f

3301302132031 has 2 divisors, whose sum is σ = 3301302132032. Its totient is φ = 3301302132030.

The previous prime is 3301302131993. The next prime is 3301302132047. The reversal of 3301302132031 is 1302312031033.

3301302132031 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 3301302132031 - 229 = 3300765261119 is a prime.

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

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

It is a congruent number.

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

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

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

Almost surely, 23301302132031 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 972, while the sum is 22.

Adding to 3301302132031 its reverse (1302312031033), we get a palindrome (4603614163064).

The spelling of 3301302132031 in words is "three trillion, three hundred one billion, three hundred two million, one hundred thirty-two thousand, thirty-one".