Search a number
-
+
110220100210937 is a prime number
BaseRepresentation
bin11001000011111010011101…
…111010111001000011111001
3112110020221100021220222102102
4121003322131322321003321
5103421321231123222222
61030230225351113145
732134065555451613
oct3103723572710371
9473227307828372
10110220100210937
113213509a156372
12104414886727b5
134966931983a72
141d30977751db3
15cb21275e9d92
hex643e9deb90f9

110220100210937 has 2 divisors, whose sum is σ = 110220100210938. Its totient is φ = 110220100210936.

The previous prime is 110220100210921. The next prime is 110220100210939. The reversal of 110220100210937 is 739012001022011.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 97601378594281 + 12618721616656 = 9879341^2 + 3552284^2 .

It is a cyclic number.

It is not a de Polignac number, because 110220100210937 - 24 = 110220100210921 is a prime.

Together with 110220100210939, it forms a pair of twin primes.

It is a Chen prime.

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

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

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

Almost surely, 2110220100210937 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 1512, while the sum is 29.

Adding to 110220100210937 its reverse (739012001022011), we get a palindrome (849232101232948).

The spelling of 110220100210937 in words is "one hundred ten trillion, two hundred twenty billion, one hundred million, two hundred ten thousand, nine hundred thirty-seven".