Base | Representation |
---|---|
bin | 110010100000001001111011… |
… | …100001011111010110110101 |
3 | 1002010102200220221121222110001 |
4 | 302200021323201133112311 |
5 | 213103040344321401401 |
6 | 2104220503235431301 |
7 | 64533030456561622 |
oct | 6240117341372665 |
9 | 1063380827558401 |
10 | 222112011122101 |
11 | 648541a1915061 |
12 | 20ab2967155531 |
13 | 96c20c3b73749 |
14 | 3cbc3c8a67349 |
15 | 1aa299a858601 |
hex | ca027b85f5b5 |
222112011122101 has 6 divisors (see below), whose sum is σ = 226938347264630. Its totient is φ = 217386223649256.
The previous prime is 222112011122081. The next prime is 222112011122129. The reversal of 222112011122101 is 101221110211222.
It is a happy number.
It can be written as a sum of positive squares in only one way, i.e., 144128452633201 + 77983558488900 = 12005351^2 + 8830830^2 .
It is not a de Polignac number, because 222112011122101 - 229 = 222111474251189 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (222112011122161) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 50274332586 + ... + 50274337003.
Almost surely, 2222112011122101 is an apocalyptic number.
It is an amenable number.
222112011122101 is a deficient number, since it is larger than the sum of its proper divisors (4826336142529).
222112011122101 is an equidigital number, since it uses as much as digits as its factorization.
222112011122101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 100548669683 (or 100548669636 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 19.
Adding to 222112011122101 its reverse (101221110211222), we get a palindrome (323333121333323).
The spelling of 222112011122101 in words is "two hundred twenty-two trillion, one hundred twelve billion, eleven million, one hundred twenty-two thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •