Search a number
-
+
321013022329 is a prime number
BaseRepresentation
bin1001010101111011101…
…11011111111001111001
31010200120221122011101101
410222331313133321321
520224413313203304
6403245451051401
732123000445166
oct4527567377171
91120527564341
10321013022329
11114160533a5a
125226a740b61
132436b352b2c
1411773ba506d
15853c32e8a4
hex4abdddfe79

321013022329 has 2 divisors, whose sum is σ = 321013022330. Its totient is φ = 321013022328.

The previous prime is 321013022293. The next prime is 321013022333. The reversal of 321013022329 is 923220310123.

Together with previous prime (321013022293) 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., 304205196304 + 16807826025 = 551548^2 + 129645^2 .

It is a cyclic number.

It is not a de Polignac number, because 321013022329 - 213 = 321013014137 is a prime.

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

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

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

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

Almost surely, 2321013022329 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 3888, while the sum is 28.

The spelling of 321013022329 in words is "three hundred twenty-one billion, thirteen million, twenty-two thousand, three hundred twenty-nine".