Search a number
-
+
1311333110233 is a prime number
BaseRepresentation
bin10011000101010001100…
…010110101000111011001
311122100210001121002210121
4103011101202311013121
5132441102234011413
62442230151313241
7163512025345156
oct23052142650731
94570701532717
101311333110233
114661513996a3
1219218a97b821
1396873043423
144767c7ab22d
152419dd63b8d
hex131518b51d9

1311333110233 has 2 divisors, whose sum is σ = 1311333110234. Its totient is φ = 1311333110232.

The previous prime is 1311333110203. The next prime is 1311333110327. The reversal of 1311333110233 is 3320113331131.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 1015846283664 + 295486826569 = 1007892^2 + 543587^2 .

It is a cyclic number.

It is not a de Polignac number, because 1311333110233 - 233 = 1302743175641 is a prime.

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

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

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

Almost surely, 21311333110233 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 1458, while the sum is 25.

Adding to 1311333110233 its reverse (3320113331131), we get a palindrome (4631446441364).

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