Base | Representation |
---|---|
bin | 11001011101110100001110… |
… | …110101001100001001101001 |
3 | 112200120002212022021010111101 |
4 | 121131310032311030021221 |
5 | 104140002211404032332 |
6 | 1034112050220001401 |
7 | 32406512105522344 |
oct | 3135641665141151 |
9 | 480502768233441 |
10 | 112000111002217 |
11 | 32760a86907649 |
12 | 1068a456690261 |
13 | 4a6574682c0c9 |
14 | 1d92b9744745b |
15 | ce35a7319ae7 |
hex | 65dd0ed4c269 |
112000111002217 has 2 divisors, whose sum is σ = 112000111002218. Its totient is φ = 112000111002216.
The previous prime is 112000111002173. The next prime is 112000111002223. The reversal of 112000111002217 is 712200111000211.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 104985352167696 + 7014758834521 = 10246236^2 + 2648539^2 .
It is a cyclic number.
It is not a de Polignac number, because 112000111002217 - 239 = 111450355188329 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 112000111002194 and 112000111002203.
It is not a weakly prime, because it can be changed into another prime (112000111003217) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 56000055501108 + 56000055501109.
It is an arithmetic number, because the mean of its divisors is an integer number (56000055501109).
Almost surely, 2112000111002217 is an apocalyptic number.
It is an amenable number.
112000111002217 is a deficient number, since it is larger than the sum of its proper divisors (1).
112000111002217 is an equidigital number, since it uses as much as digits as its factorization.
112000111002217 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 56, while the sum is 19.
Adding to 112000111002217 its reverse (712200111000211), we get a palindrome (824200222002428).
The spelling of 112000111002217 in words is "one hundred twelve trillion, one hundred eleven million, two thousand, two hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •