Search a number
-
+
11302331321 is a prime number
BaseRepresentation
bin10101000011010101…
…11110001110111001
31002011200022220211202
422201222332032321
5141121344100241
65105304103545
7550040142161
oct124152761671
932150286752
1011302331321
11487a964896
122235164bb5
1310b1760618
147930cd5a1
154623add9b
hex2a1abe3b9

11302331321 has 2 divisors, whose sum is σ = 11302331322. Its totient is φ = 11302331320.

The previous prime is 11302331231. The next prime is 11302331329. The reversal of 11302331321 is 12313320311.

Together with previous prime (11302331231) it forms an Ormiston pair, because they use the same digits, order apart.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 11201047225 + 101284096 = 105835^2 + 10064^2 .

It is a cyclic number.

It is not a de Polignac number, because 11302331321 - 222 = 11298137017 is a prime.

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

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

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

Almost surely, 211302331321 is an apocalyptic number.

It is an amenable number.

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

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

11302331321 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 20.

Adding to 11302331321 its reverse (12313320311), we get a palindrome (23615651632).

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