Base | Representation |
---|---|
bin | 10110110010011010001011… |
… | …001011110000011111100110 |
3 | 111010212001011220201212222110 |
4 | 112302122023023300133212 |
5 | 101114010304103000402 |
6 | 553052534425541450 |
7 | 30052510223136366 |
oct | 2662321313603746 |
9 | 433761156655873 |
10 | 100221102000102 |
11 | 29a2a592358386 |
12 | b2a7630344886 |
13 | 43bca6a240bc5 |
14 | 1aa6a276b89a6 |
15 | b8beaa5dd56c |
hex | 5b268b2f07e6 |
100221102000102 has 8 divisors (see below), whose sum is σ = 200442204000216. Its totient is φ = 33407034000032.
The previous prime is 100221102000083. The next prime is 100221102000127. The reversal of 100221102000102 is 201000201122001.
It is a sphenic number, since it is the product of 3 distinct primes.
100221102000102 is an admirable number.
It is a super-2 number, since 2×1002211020001022 (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, 8351758500003 + ... + 8351758500014.
It is an arithmetic number, because the mean of its divisors is an integer number (25055275500027).
Almost surely, 2100221102000102 is an apocalyptic number.
100221102000102 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.
100221102000102 is a wasteful number, since it uses less digits than its factorization.
100221102000102 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16703517000022.
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 100221102000102 its reverse (201000201122001), we get a palindrome (301221303122103).
The spelling of 100221102000102 in words is "one hundred trillion, two hundred twenty-one billion, one hundred two million, one hundred two", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •