Base | Representation |
---|---|
bin | 10111000000110100011101… |
… | …101010111101011010110100 |
3 | 111021100201022122010220200220 |
4 | 113000310131222331122310 |
5 | 101231221422421143444 |
6 | 555131513134334340 |
7 | 30214165616310135 |
oct | 2700643552753264 |
9 | 437321278126626 |
10 | 101211402131124 |
11 | 2a281572a2212a |
12 | b42754595a3b0 |
13 | 446226aa648ac |
14 | 1adc92d7a7c8c |
15 | ba7b1a4ce619 |
hex | 5c0d1dabd6b4 |
101211402131124 has 48 divisors (see below), whose sum is σ = 236432075378688. Its totient is φ = 33698279089888.
The previous prime is 101211402131123. The next prime is 101211402131171. The reversal of 101211402131124 is 421131204112101.
It is a junction number, because it is equal to n+sod(n) for n = 101211402131094 and 101211402131103.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101211402131123) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 35881537 + ... + 38599319.
It is an arithmetic number, because the mean of its divisors is an integer number (4925668237056).
Almost surely, 2101211402131124 is an apocalyptic number.
It is an amenable number.
101211402131124 is an abundant number, since it is smaller than the sum of its proper divisors (135220673247564).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101211402131124 is a wasteful number, since it uses less digits than its factorization.
101211402131124 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2721364 (or 2721362 counting only the distinct ones).
The product of its (nonzero) digits is 384, while the sum is 24.
Adding to 101211402131124 its reverse (421131204112101), we get a palindrome (522342606243225).
The spelling of 101211402131124 in words is "one hundred one trillion, two hundred eleven billion, four hundred two million, one hundred thirty-one thousand, one hundred twenty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •