Search a number
-
+
323211130101131 is a prime number
BaseRepresentation
bin100100101111101010111010…
…0100110001101110110001011
31120101101200102101012202220012
41021133111310212031312023
5314330442343301214011
63103225050544422135
7125036143052150366
oct11137256446156613
91511350371182805
10323211130101131
1193a92085933118
123030059561794b
1310b468a93b4a6c
1459b5705d270dd
1527576e359aa8b
hex125f57498dd8b

323211130101131 has 2 divisors, whose sum is σ = 323211130101132. Its totient is φ = 323211130101130.

The previous prime is 323211130101103. The next prime is 323211130101151. The reversal of 323211130101131 is 131101031112323.

It is a strong prime.

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-323211130101131 is a prime.

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

It is a junction number, because it is equal to n+sod(n) for n = 323211130101097 and 323211130101106.

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

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

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

Almost surely, 2323211130101131 is an apocalyptic number.

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

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

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

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

Adding to 323211130101131 its reverse (131101031112323), we get a palindrome (454312161213454).

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