Search a number
-
+
110122200209981 is a prime number
BaseRepresentation
bin11001000010011111010010…
…101000000001101000111101
3112102220120122110210122022002
4121002133102220001220331
5103413220231223204411
61030113235042232045
732124031531254401
oct3102372250015075
9472816573718262
10110122200209981
11320a7621158673
1210426506055625
13495a62c26190b
141d29d2b57b101
15cae7e792733b
hex6427d2a01a3d

110122200209981 has 2 divisors, whose sum is σ = 110122200209982. Its totient is φ = 110122200209980.

The previous prime is 110122200209953. The next prime is 110122200210053. The reversal of 110122200209981 is 189902002221011.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 91479373315225 + 18642826894756 = 9564485^2 + 4317734^2 .

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-110122200209981 is a prime.

It is a super-2 number, since 2×1101222002099812 (a number of 29 digits) contains 22 as substring.

It is a congruent number.

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

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

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

Almost surely, 2110122200209981 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 10368, while the sum is 38.

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