Search a number
-
+
331221113130331 is a prime number
BaseRepresentation
bin100101101001111100110110…
…0110010100100110101011011
31121102202102120212102121022201
41023103321230302210311123
5321403211314430132311
63132240513451431031
7126523635645420214
oct11323715462446533
91542672525377281
10331221113130331
11965a00a3499a06
1231194a54755477
13112a802b303998
145bb128a38c40b
152845c4bb6a9c1
hex12d3e6cca4d5b

331221113130331 has 2 divisors, whose sum is σ = 331221113130332. Its totient is φ = 331221113130330.

The previous prime is 331221113130293. The next prime is 331221113130337. The reversal of 331221113130331 is 133031311122133.

It is a happy number.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 331221113130331 - 233 = 331212523195739 is a prime.

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

It is a self number, because there is not a number n which added to its sum of digits gives 331221113130331.

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

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

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

Almost surely, 2331221113130331 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 2916, while the sum is 28.

Adding to 331221113130331 its reverse (133031311122133), we get a palindrome (464252424252464).

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