Search a number
-
+
231002122333 is a prime number
BaseRepresentation
bin1101011100100011001…
…1001010100001011101
3211002020221020200021111
43113020303022201131
512241043020403313
6254042041102021
722455306433213
oct3271063124135
9732227220244
10231002122333
1189a70748604
123892a187911
1318a251b5468
14b27566acb3
15602004d43d
hex35c8cca85d

231002122333 has 2 divisors, whose sum is σ = 231002122334. Its totient is φ = 231002122332.

The previous prime is 231002122289. The next prime is 231002122361. The reversal of 231002122333 is 333221200132.

231002122333 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 can be written as a sum of positive squares in only one way, i.e., 194060513529 + 36941608804 = 440523^2 + 192202^2 .

It is a cyclic number.

It is not a de Polignac number, because 231002122333 - 221 = 231000025181 is a prime.

It is a congruent number.

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

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

Almost surely, 2231002122333 is an apocalyptic number.

It is an amenable number.

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

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

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

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

Adding to 231002122333 its reverse (333221200132), we get a palindrome (564223322465).

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