Search a number
-
+
110022221020037 is a prime number
BaseRepresentation
bin11001000001000010001011…
…011001101011101110000101
3112102120000120202022120002012
4121001002023121223232011
5103410101002040120122
61025555302141224005
732113562126210534
oct3101021331535605
9472500522276065
10110022221020037
1132069186546467
121040b063262005
134951087b5a221
141d251651b631b
15cabde544d7e2
hex64108b66bb85

110022221020037 has 2 divisors, whose sum is σ = 110022221020038. Its totient is φ = 110022221020036.

The previous prime is 110022221019983. The next prime is 110022221020051. The reversal of 110022221020037 is 730020122220011.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 109650406445281 + 371814574756 = 10471409^2 + 609766^2 .

It is a cyclic number.

It is not a de Polignac number, because 110022221020037 - 216 = 110022220954501 is a prime.

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

It is a congruent number.

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

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

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

Almost surely, 2110022221020037 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 672, while the sum is 23.

Adding to 110022221020037 its reverse (730020122220011), we get a palindrome (840042343240048).

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