Base | Representation |
---|---|
bin | 1010000000111001100010… |
… | …00110110111101011101000 |
3 | 2212222012100210121001101001 |
4 | 11000130301012313223220 |
5 | 10341243224012223422 |
6 | 114500210300004344 |
7 | 4431654624611632 |
oct | 500346106675350 |
9 | 85865323531331 |
10 | 22021121211112 |
11 | 702011791a3a1 |
12 | 2577a10b306b4 |
13 | c397765bc15a |
14 | 561b83c93a52 |
15 | 282c47255227 |
hex | 1407311b7ae8 |
22021121211112 has 8 divisors (see below), whose sum is σ = 41289602270850. Its totient is φ = 11010560605552.
The previous prime is 22021121211083. The next prime is 22021121211113. The reversal of 22021121211112 is 21111212112022.
It is a happy number.
It can be written as a sum of positive squares in only one way, i.e., 18994029269796 + 3027091941316 = 4358214^2 + 1739854^2 .
It is a tau number, because it is divible by the number of its divisors (8).
It is a self number, because there is not a number n which added to its sum of digits gives 22021121211112.
It is not an unprimeable number, because it can be changed into a prime (22021121211113) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1376320075687 + ... + 1376320075702.
Almost surely, 222021121211112 is an apocalyptic number.
It is an amenable number.
22021121211112 is a deficient number, since it is larger than the sum of its proper divisors (19268481059738).
22021121211112 is a wasteful number, since it uses less digits than its factorization.
22021121211112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2752640151395 (or 2752640151391 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 19.
Adding to 22021121211112 its reverse (21111212112022), we get a palindrome (43132333323134).
The spelling of 22021121211112 in words is "twenty-two trillion, twenty-one billion, one hundred twenty-one million, two hundred eleven thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •