Search a number
-
+
113103220022101 is a prime number
BaseRepresentation
bin11001101101110111100101…
…010000001001101101010101
3112211110120011212111110201201
4121231313211100021231111
5104311040343311201401
61040314522454352501
732552303141502661
oct3155674520115525
9484416155443651
10113103220022101
1133046896120261
12108281b365b731
134b1578476caca
141dd03217b58a1
15d1211abe6b01
hex66dde5409b55

113103220022101 has 2 divisors, whose sum is σ = 113103220022102. Its totient is φ = 113103220022100.

The previous prime is 113103220022071. The next prime is 113103220022201. The reversal of 113103220022101 is 101220022301311.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 91397404919601 + 21705815102500 = 9560199^2 + 4658950^2 .

It is an emirp because it is prime and its reverse (101220022301311) is a distict prime.

It is a cyclic number.

It is not a de Polignac number, because 113103220022101 - 27 = 113103220021973 is a prime.

It is a congruent number.

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

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

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

Almost surely, 2113103220022101 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 144, while the sum is 19.

Adding to 113103220022101 its reverse (101220022301311), we get a palindrome (214323242323412).

The spelling of 113103220022101 in words is "one hundred thirteen trillion, one hundred three billion, two hundred twenty million, twenty-two thousand, one hundred one".