Search a number
-
+
6311156710381 is a prime number
BaseRepresentation
bin101101111010110111001…
…0000001111101111101101
3211100100012100210012002221
41123311232100033233231
51311400222104213011
621231145543115341
71220652226625125
oct133655620175755
924310170705087
106311156710381
112013601482356
1285b189742b51
1336a1a76c4383
1417b666955c85
15ae27ad3d971
hex5bd6e40fbed

6311156710381 has 2 divisors, whose sum is σ = 6311156710382. Its totient is φ = 6311156710380.

The previous prime is 6311156710333. The next prime is 6311156710421. The reversal of 6311156710381 is 1830176511136.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 6202919000356 + 108237710025 = 2490566^2 + 328995^2 .

It is a cyclic number.

It is not a de Polignac number, because 6311156710381 - 217 = 6311156579309 is a prime.

It is a super-3 number, since 3×63111567103813 (a number of 39 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.

It is a congruent number.

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

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

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

Almost surely, 26311156710381 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 90720, while the sum is 43.

The spelling of 6311156710381 in words is "six trillion, three hundred eleven billion, one hundred fifty-six million, seven hundred ten thousand, three hundred eighty-one".