Base | Representation |
---|---|
bin | 10110110010011011001101… |
… | …111100010000101011011110 |
3 | 111010212011001222020100020100 |
4 | 112302123031330100223132 |
5 | 101114020102313323402 |
6 | 553053241515401530 |
7 | 30052550043105522 |
oct | 2662331574205336 |
9 | 433764058210210 |
10 | 100222222011102 |
11 | 29a300075a0204 |
12 | b2a78a34532a6 |
13 | 43bcbb82a9cc9 |
14 | 1aa6ad2345d82 |
15 | b8c023ac871c |
hex | 5b26cdf10ade |
100222222011102 has 48 divisors (see below), whose sum is σ = 236458963026000. Its totient is φ = 30557773677312.
The previous prime is 100222222011097. The next prime is 100222222011113. The reversal of 100222222011102 is 201110222222001.
It is a happy number.
It is a super-2 number, since 2×1002222220111022 (a number of 29 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 5052532027 + ... + 5052551862.
It is an arithmetic number, because the mean of its divisors is an integer number (4926228396375).
Almost surely, 2100222222011102 is an apocalyptic number.
100222222011102 is an abundant number, since it is smaller than the sum of its proper divisors (136236741014898).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
100222222011102 is a wasteful number, since it uses less digits than its factorization.
100222222011102 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10105083945 (or 10105083942 counting only the distinct ones).
The product of its (nonzero) digits is 128, while the sum is 18.
Adding to 100222222011102 its reverse (201110222222001), we get a palindrome (301332444233103).
The spelling of 100222222011102 in words is "one hundred trillion, two hundred twenty-two billion, two hundred twenty-two million, eleven thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •