Search a number
-
+
112001100220021 is a prime number
BaseRepresentation
bin11001011101110101001001…
…110010110000011001110101
3112200120012102020122121012211
4121131311021302300121311
5104140011223124020041
61034112332314213421
732406545446655305
oct3135651162603165
9480505366577184
10112001100220021
1132761444236621
121068a691a24271
134a6587376269c
141d92c4c989605
15ce36140bb481
hex65dd49cb0675

112001100220021 has 2 divisors, whose sum is σ = 112001100220022. Its totient is φ = 112001100220020.

The previous prime is 112001100219991. The next prime is 112001100220103. The reversal of 112001100220021 is 120022001100211.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 93079774701796 + 18921325518225 = 9647786^2 + 4349865^2 .

It is a cyclic number.

It is not a de Polignac number, because 112001100220021 - 215 = 112001100187253 is a prime.

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

It is a congruent number.

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

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

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

Almost surely, 2112001100220021 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 16, while the sum is 13.

Adding to 112001100220021 its reverse (120022001100211), we get a palindrome (232023101320232).

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