Search a number
-
+
110221122101201 is a prime number
BaseRepresentation
bin11001000011111011011010…
…110101000101111111010001
3112110021000222111210101022222
4121003323122311011333101
5103421330324224214301
61030230515013510425
732134133104413536
oct3103733265057721
9473230874711288
10110221122101201
1132135573a70681
1210441712942415
134966a655b6867
141d30a3335ad8d
15cb21871a231b
hex643edad45fd1

110221122101201 has 2 divisors, whose sum is σ = 110221122101202. Its totient is φ = 110221122101200.

The previous prime is 110221122101177. The next prime is 110221122101239. The reversal of 110221122101201 is 102101221122011.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 56355049000000 + 53866073101201 = 7507000^2 + 7339351^2 .

It is a cyclic number.

It is not a de Polignac number, because 110221122101201 - 222 = 110221117906897 is a prime.

It is a self number, because there is not a number n which added to its sum of digits gives 110221122101201.

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

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

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

Almost surely, 2110221122101201 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 32, while the sum is 17.

Adding to 110221122101201 its reverse (102101221122011), we get a palindrome (212322343223212).

The spelling of 110221122101201 in words is "one hundred ten trillion, two hundred twenty-one billion, one hundred twenty-two million, one hundred one thousand, two hundred one".