Base | Representation |
---|---|
bin | 10110110010010000110010… |
… | …010111101100000110010100 |
3 | 111010211002011102110220011120 |
4 | 112302100302113230012110 |
5 | 101113324133114133022 |
6 | 553044150305003540 |
7 | 30052002354546300 |
oct | 2662206227540624 |
9 | 433732142426146 |
10 | 100211022021012 |
11 | 29a2628a486951 |
12 | b2a56986235b0 |
13 | 43bbb21acca36 |
14 | 1aa634ca96d00 |
15 | b8baba6d2d5c |
hex | 5b24325ec194 |
100211022021012 has 144 divisors (see below), whose sum is σ = 292299955311168. Its totient is φ = 26545300024320.
The previous prime is 100211022020981. The next prime is 100211022021031. The reversal of 100211022021012 is 210120220112001.
It is a junction number, because it is equal to n+sod(n) for n = 100211022020982 and 100211022021000.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 74144539 + ... + 75484002.
It is an arithmetic number, because the mean of its divisors is an integer number (2029860800772).
Almost surely, 2100211022021012 is an apocalyptic number.
100211022021012 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
100211022021012 is an abundant number, since it is smaller than the sum of its proper divisors (192088933290156).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
100211022021012 is a wasteful number, since it uses less digits than its factorization.
100211022021012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 149628646 (or 149628637 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 100211022021012 its reverse (210120220112001), we get a palindrome (310331242133013).
The spelling of 100211022021012 in words is "one hundred trillion, two hundred eleven billion, twenty-two million, twenty-one thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •