Base | Representation |
---|---|
bin | 10110111111001101110110… |
… | …011000000100100010110101 |
3 | 111020222011220221021210100220 |
4 | 112333031312120010202311 |
5 | 101222420300111431401 |
6 | 555005132042524553 |
7 | 30203215340001621 |
oct | 2677156630044265 |
9 | 436864827253326 |
10 | 101101221202101 |
11 | 2a2398727353aa |
12 | b40a116506759 |
13 | 4454a5bc29cc3 |
14 | 1ad747a568181 |
15 | ba4d1c598336 |
hex | 5bf3766048b5 |
101101221202101 has 16 divisors (see below), whose sum is σ = 140150713872000. Its totient is φ = 64749629786688.
The previous prime is 101101221202081. The next prime is 101101221202151. The reversal of 101101221202101 is 101202122101101.
It is a happy number.
It is not a de Polignac number, because 101101221202101 - 214 = 101101221185717 is a prime.
It is a super-3 number, since 3×1011012212021013 (a number of 43 digits) contains 333 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101101221202151) 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, 2919789226 + ... + 2919823851.
It is an arithmetic number, because the mean of its divisors is an integer number (8759419617000).
Almost surely, 2101101221202101 is an apocalyptic number.
It is an amenable number.
101101221202101 is a deficient number, since it is larger than the sum of its proper divisors (39049492669899).
101101221202101 is a wasteful number, since it uses less digits than its factorization.
101101221202101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5839613308.
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 101101221202101 its reverse (101202122101101), we get a palindrome (202303343303202).
The spelling of 101101221202101 in words is "one hundred one trillion, one hundred one billion, two hundred twenty-one million, two hundred two thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •