Base | Representation |
---|---|
bin | 10110111101110001100011… |
… | …100111000000010011111100 |
3 | 111020121201010112211220110120 |
4 | 112331301203213000103330 |
5 | 101214304321224231022 |
6 | 554451422341134540 |
7 | 30163106512360515 |
oct | 2675614347002374 |
9 | 436551115756416 |
10 | 101002122102012 |
11 | 2a20083989678a |
12 | b3b2a7a3ba450 |
13 | 44485c7c6a741 |
14 | 1ad2759019a0c |
15 | ba246c4b6d5c |
hex | 5bdc639c04fc |
101002122102012 has 192 divisors, whose sum is σ = 245686333820928. Its totient is φ = 32271768576000.
The previous prime is 101002122101983. The next prime is 101002122102047. The reversal of 101002122102012 is 210201221200101.
It is a junction number, because it is equal to n+sod(n) for n = 101002122101982 and 101002122102000.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 3309684978 + ... + 3309715494.
It is an arithmetic number, because the mean of its divisors is an integer number (1279616321984).
Almost surely, 2101002122102012 is an apocalyptic number.
101002122102012 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
101002122102012 is an abundant number, since it is smaller than the sum of its proper divisors (144684211718916).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101002122102012 is a wasteful number, since it uses less digits than its factorization.
101002122102012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 31180 (or 31178 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 101002122102012 its reverse (210201221200101), we get a palindrome (311203343302113).
The spelling of 101002122102012 in words is "one hundred one trillion, two billion, one hundred twenty-two million, one hundred two thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.249 sec. • engine limits •