Search a number
-
+
3206029017131 is a prime number
BaseRepresentation
bin101110101001110110001…
…110001000000000101011
3102100111022200012202122022
4232221312032020000223
5410011421412022011
610452455052215055
7450425250002363
oct56516616100053
912314280182568
103206029017131
11102673a887766
1243942476a48b
131a3433c37625
14b125b9bb9a3
15585e21338db
hex2ea7638802b

3206029017131 has 2 divisors, whose sum is σ = 3206029017132. Its totient is φ = 3206029017130.

The previous prime is 3206029017119. The next prime is 3206029017133. The reversal of 3206029017131 is 1317109206023.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 3206029017131 - 222 = 3206024822827 is a prime.

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

Together with 3206029017133, 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 = 3206029017091 and 3206029017100.

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

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

Almost surely, 23206029017131 is an apocalyptic number.

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

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

3206029017131 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 35.

The spelling of 3206029017131 in words is "three trillion, two hundred six billion, twenty-nine million, seventeen thousand, one hundred thirty-one".