Search a number
-
+
113222220212113 is a prime number
BaseRepresentation
bin11001101111100110011010…
…001101110110011110010001
3112211212221100012100110202121
4121233212122031312132101
5104320013101333241423
61040445323033414241
732564015110435315
oct3157463215663621
9484787305313677
10113222220212113
1133092301681331
121084728456a381
134b23a6a78561c
141dd5db001db45
15d1528300745d
hex66f99a376791

113222220212113 has 2 divisors, whose sum is σ = 113222220212114. Its totient is φ = 113222220212112.

The previous prime is 113222220212089. The next prime is 113222220212147. The reversal of 113222220212113 is 311212022222311.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 58102628210064 + 55119592002049 = 7622508^2 + 7424257^2 .

It is a cyclic number.

It is not a de Polignac number, because 113222220212113 - 29 = 113222220211601 is a prime.

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

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

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

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

Almost surely, 2113222220212113 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 1152, while the sum is 25.

Adding to 113222220212113 its reverse (311212022222311), we get a palindrome (424434242434424).

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