Search a number
-
+
110213222321 is a prime number
BaseRepresentation
bin110011010100100111…
…0000100111110110001
3101112110221121210102002
41212221032010332301
53301204041103241
6122344203503345
710651120634606
oct1465116047661
9345427553362
10110213222321
1142817544204
121943a227b55
13a515733667
1454976486ad
152d00bb489b
hex19a9384fb1

110213222321 has 2 divisors, whose sum is σ = 110213222322. Its totient is φ = 110213222320.

The previous prime is 110213222297. The next prime is 110213222369. The reversal of 110213222321 is 123222312011.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 106971514225 + 3241708096 = 327065^2 + 56936^2 .

It is a cyclic number.

It is not a de Polignac number, because 110213222321 - 210 = 110213221297 is a prime.

It is a Sophie Germain prime.

It is a Curzon number.

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

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

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

Almost surely, 2110213222321 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 288, while the sum is 20.

Adding to 110213222321 its reverse (123222312011), we get a palindrome (233435534332).

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