Search a number
-
+
110221333121213 is a prime number
BaseRepresentation
bin11001000011111011100111…
…011010000100100010111101
3112110021001112012212022100222
4121003323213122010202331
5103421331242234334323
61030230551552431125
732134141246146326
oct3103734732044275
9473231465768328
10110221333121213
11321356720a0086
12104417715484a5
134966a9a22ba82
141d30a533ab44d
15cb219a9869c8
hex643ee76848bd

110221333121213 has 2 divisors, whose sum is σ = 110221333121214. Its totient is φ = 110221333121212.

The previous prime is 110221333121171. The next prime is 110221333121219. The reversal of 110221333121213 is 312121333122011.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 90628077134884 + 19593255986329 = 9519878^2 + 4426427^2 .

It is a cyclic number.

It is not a de Polignac number, because 110221333121213 - 210 = 110221333120189 is a prime.

It is a Sophie Germain prime.

It is a Curzon number.

It is a congruent number.

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

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

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

Almost surely, 2110221333121213 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 1296, while the sum is 26.

Adding to 110221333121213 its reverse (312121333122011), we get a palindrome (422342666243224).

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