Base | Representation |
---|---|
bin | 10001110010001010111… |
… | …010001011101100010000 |
3 | 11022211110100001102100022 |
4 | 101302022322023230100 |
5 | 130010330403020422 |
6 | 2333231530243012 |
7 | 154202543655053 |
oct | 21621272135420 |
9 | 4284410042308 |
10 | 1222101220112 |
11 | 431321307963 |
12 | 178a27286468 |
13 | 8b3223b9946 |
14 | 432158d6a9a |
15 | 21bca160342 |
hex | 11c8ae8bb10 |
1222101220112 has 80 divisors (see below), whose sum is σ = 2553765715200. Its totient is φ = 564653306880.
The previous prime is 1222101220099. The next prime is 1222101220117. The reversal of 1222101220112 is 2110221012221.
It is not an unprimeable number, because it can be changed into a prime (1222101220117) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 96701858 + ... + 96714494.
It is an arithmetic number, because the mean of its divisors is an integer number (31922071440).
Almost surely, 21222101220112 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1222101220112, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1276882857600).
1222101220112 is an abundant number, since it is smaller than the sum of its proper divisors (1331664495088).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1222101220112 is a wasteful number, since it uses less digits than its factorization.
1222101220112 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 20464 (or 20458 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 17.
Adding to 1222101220112 its reverse (2110221012221), we get a palindrome (3332322232333).
The spelling of 1222101220112 in words is "one trillion, two hundred twenty-two billion, one hundred one million, two hundred twenty thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •