Search a number
-
+
110112202201021 is a prime number
BaseRepresentation
bin11001000010010101111110…
…101100101001011110111101
3112102212121211200210011100221
4121002111332230221132331
5103413034242230413041
61030104503010221341
732123226006504256
oct3102257654513675
9472777750704327
10110112202201021
11320a3360583549
1210424595884851
1349596c7ac0797
141d2965d7b5b2d
15cae40ed0e2d1
hex64257eb297bd

110112202201021 has 2 divisors, whose sum is σ = 110112202201022. Its totient is φ = 110112202201020.

The previous prime is 110112202200983. The next prime is 110112202201081. The reversal of 110112202201021 is 120102202211011.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 83113671888900 + 26998530312121 = 9116670^2 + 5196011^2 .

It is a cyclic number.

It is not a de Polignac number, because 110112202201021 - 29 = 110112202200509 is a prime.

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

It is a congruent number.

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

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

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

Almost surely, 2110112202201021 is an apocalyptic number.

It is an amenable number.

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

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

110112202201021 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 16.

Adding to 110112202201021 its reverse (120102202211011), we get a palindrome (230214404412032).

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