Search a number
-
+
323211032100113 is a prime number
BaseRepresentation
bin100100101111101010110111…
…0110000010111110100010001
31120101101200011112210210202212
41021133111232300113310101
5314330442143204200423
63103225033124121505
7125036140452152213
oct11137255660276421
91511350145723685
10323211032100113
1193a92035587543
1230300568836295
1310b46891cc10b1
1459b56d6cd65b3
1527576d9b8d578
hex125f56ec17d11

323211032100113 has 2 divisors, whose sum is σ = 323211032100114. Its totient is φ = 323211032100112.

The previous prime is 323211032100101. The next prime is 323211032100119. The reversal of 323211032100113 is 311001230112323.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 241271821187329 + 81939210912784 = 15532927^2 + 9052028^2 .

It is a cyclic number.

It is not a de Polignac number, because 323211032100113 - 234 = 323193852230929 is a prime.

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

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

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

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

Almost surely, 2323211032100113 is an apocalyptic number.

It is an amenable number.

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

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

323211032100113 is an evil number, because the sum of its binary digits is even.

The product of its (nonzero) digits is 648, while the sum is 23.

Adding to 323211032100113 its reverse (311001230112323), we get a palindrome (634212262212436).

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