Base | Representation |
---|---|
bin | 110100010000011100… |
… | …1001100010011011101 |
3 | 101201122212122010201201 |
4 | 1220200321030103131 |
5 | 3314312034410323 |
6 | 123315325435501 |
7 | 11051640605431 |
oct | 1504071142335 |
9 | 351585563651 |
10 | 112221013213 |
11 | 43657922221 |
12 | 198ba70bb91 |
13 | a7756a7bca |
14 | 56081709c1 |
15 | 2dbc0b58ad |
hex | 1a20e4c4dd |
112221013213 has 2 divisors, whose sum is σ = 112221013214. Its totient is φ = 112221013212.
The previous prime is 112221013187. The next prime is 112221013217. The reversal of 112221013213 is 312310122211.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 107611553764 + 4609459449 = 328042^2 + 67893^2 .
It is a cyclic number.
It is not a de Polignac number, because 112221013213 - 225 = 112187458781 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (112221013217) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 56110506606 + 56110506607.
It is an arithmetic number, because the mean of its divisors is an integer number (56110506607).
Almost surely, 2112221013213 is an apocalyptic number.
It is an amenable number.
112221013213 is a deficient number, since it is larger than the sum of its proper divisors (1).
112221013213 is an equidigital number, since it uses as much as digits as its factorization.
112221013213 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 112221013213 its reverse (312310122211), we get a palindrome (424531135424).
The spelling of 112221013213 in words is "one hundred twelve billion, two hundred twenty-one million, thirteen thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •