Base | Representation |
---|---|
bin | 10110110000110100101010… |
… | …110100111001001001011110 |
3 | 111010110121212011100010211120 |
4 | 112300310222310321021132 |
5 | 101110214100432223402 |
6 | 552530511411031410 |
7 | 30041601304542144 |
oct | 2660645264711136 |
9 | 433417764303746 |
10 | 100112111211102 |
11 | 29998342952451 |
12 | b28a49359b566 |
13 | 43b26bab57893 |
14 | 1aa164855d594 |
15 | b8922bde63bc |
hex | 5b0d2ad3925e |
100112111211102 has 8 divisors (see below), whose sum is σ = 200224222422216. Its totient is φ = 33370703737032.
The previous prime is 100112111211043. The next prime is 100112111211157. The reversal of 100112111211102 is 201112111211001.
It is a sphenic number, since it is the product of 3 distinct primes.
100112111211102 is an admirable number.
It is a super-2 number, since 2×1001121112111022 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 8342675934253 + ... + 8342675934264.
It is an arithmetic number, because the mean of its divisors is an integer number (25028027802777).
Almost surely, 2100112111211102 is an apocalyptic number.
100112111211102 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
100112111211102 is a wasteful number, since it uses less digits than its factorization.
100112111211102 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 16685351868522.
The product of its (nonzero) digits is 8, while the sum is 15.
Adding to 100112111211102 its reverse (201112111211001), we get a palindrome (301224222422103).
The spelling of 100112111211102 in words is "one hundred trillion, one hundred twelve billion, one hundred eleven million, two hundred eleven thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •