Base | Representation |
---|---|
bin | 110100101110010010… |
… | …0100000010100001001 |
3 | 101211020122120212111212 |
4 | 1221130210200110021 |
5 | 3323334342114423 |
6 | 124002533102505 |
7 | 11115516005636 |
oct | 1513444402411 |
9 | 354218525455 |
10 | 113222223113 |
11 | 44020aa201a |
12 | 19b39a87a35 |
13 | a8a4c499bc |
14 | 56a111518d |
15 | 2e29e35578 |
hex | 1a5c920509 |
113222223113 has 2 divisors, whose sum is σ = 113222223114. Its totient is φ = 113222223112.
The previous prime is 113222223091. The next prime is 113222223131. The reversal of 113222223113 is 311322222311.
Together with next prime (113222223131) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 57373662784 + 55848560329 = 239528^2 + 236323^2 .
It is a cyclic number.
It is not a de Polignac number, because 113222223113 - 28 = 113222222857 is a prime.
It is not a weakly prime, because it can be changed into another prime (113222223173) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 56611111556 + 56611111557.
It is an arithmetic number, because the mean of its divisors is an integer number (56611111557).
Almost surely, 2113222223113 is an apocalyptic number.
It is an amenable number.
113222223113 is a deficient number, since it is larger than the sum of its proper divisors (1).
113222223113 is an equidigital number, since it uses as much as digits as its factorization.
113222223113 is an evil number, because the sum of its binary digits is even.
The product of its digits is 864, while the sum is 23.
Adding to 113222223113 its reverse (311322222311), we get a palindrome (424544445424).
It can be divided in two parts, 11322222311 and 3, that multiplied together give a palindrome (33966666933).
The spelling of 113222223113 in words is "one hundred thirteen billion, two hundred twenty-two million, two hundred twenty-three thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •