Base | Representation |
---|---|
bin | 10110110010011001010000… |
… | …000111110110111011000000 |
3 | 111010211221121212020001220122 |
4 | 112302121100013312323000 |
5 | 101114001241421401422 |
6 | 553052252231555412 |
7 | 30052443531620312 |
oct | 2662312007667300 |
9 | 433757555201818 |
10 | 100220111122112 |
11 | 29a2a123aa5053 |
12 | b2a73b452bb68 |
13 | 43bc93cb78a77 |
14 | 1aa6971c637b2 |
15 | b8be4d60ed42 |
hex | 5b26501f6ec0 |
100220111122112 has 84 divisors (see below), whose sum is σ = 207829373062800. Its totient is φ = 47860235664384.
The previous prime is 100220111122051. The next prime is 100220111122139. The reversal of 100220111122112 is 211221111022001.
It is a super-3 number, since 3×1002201111221123 (a number of 43 digits) contains 333 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 674586014 + ... + 674734562.
Almost surely, 2100220111122112 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 100220111122112, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (103914686531400).
100220111122112 is an abundant number, since it is smaller than the sum of its proper divisors (107609261940688).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
100220111122112 is an frugal number, since it uses more digits than its factorization.
100220111122112 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 149938 (or 149251 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 17.
Adding to 100220111122112 its reverse (211221111022001), we get a palindrome (311441222144113).
The spelling of 100220111122112 in words is "one hundred trillion, two hundred twenty billion, one hundred eleven million, one hundred twenty-two thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •