Base | Representation |
---|---|
bin | 10110111110000100000100… |
… | …011111101111111111001101 |
3 | 111020200121102221212202211210 |
4 | 112332010010133233333031 |
5 | 101220121024301413401 |
6 | 554504511111205033 |
7 | 30164412236051601 |
oct | 2676040437577715 |
9 | 436617387782753 |
10 | 101022001201101 |
11 | 2a2092100490a2 |
12 | b3b68a7976779 |
13 | 444a445594376 |
14 | 1ad36c322d501 |
15 | ba2c328004d6 |
hex | 5be1047effcd |
101022001201101 has 64 divisors (see below), whose sum is σ = 143474967207936. Its totient is φ = 63091593100800.
The previous prime is 101022001201049. The next prime is 101022001201157. The reversal of 101022001201101 is 101102100220101.
It is not a de Polignac number, because 101022001201101 - 237 = 100884562247629 is a prime.
It is a super-2 number, since 2×1010220012011012 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101022001201001) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 3841565785 + ... + 3841592081.
It is an arithmetic number, because the mean of its divisors is an integer number (2241796362624).
Almost surely, 2101022001201101 is an apocalyptic number.
It is an amenable number.
101022001201101 is a deficient number, since it is larger than the sum of its proper divisors (42452966006835).
101022001201101 is a wasteful number, since it uses less digits than its factorization.
101022001201101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 31162.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 101022001201101 its reverse (101102100220101), we get a palindrome (202124101421202).
The spelling of 101022001201101 in words is "one hundred one trillion, twenty-two billion, one million, two hundred one thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •