Base | Representation |
---|---|
bin | 10110111111001101110101… |
… | …001000000001111111011001 |
3 | 111020222011212110210210111112 |
4 | 112333031311020001333121 |
5 | 101222420224224020441 |
6 | 555005130013110105 |
7 | 30203214663442643 |
oct | 2677156510017731 |
9 | 436864773723445 |
10 | 101101200220121 |
11 | 2a239861904322 |
12 | b40a10b488335 |
13 | 4454a5779192a |
14 | 1ad7477865893 |
15 | ba4d1a8014eb |
hex | 5bf375201fd9 |
101101200220121 has 32 divisors (see below), whose sum is σ = 112818412425600. Its totient is φ = 90037260149760.
The previous prime is 101101200220109. The next prime is 101101200220171. The reversal of 101101200220121 is 121022002101101.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-101101200220121 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 101101200220096 and 101101200220105.
It is not an unprimeable number, because it can be changed into a prime (101101200220171) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 902077475 + ... + 902189543.
It is an arithmetic number, because the mean of its divisors is an integer number (3525575388300).
Almost surely, 2101101200220121 is an apocalyptic number.
It is an amenable number.
101101200220121 is a deficient number, since it is larger than the sum of its proper divisors (11717212205479).
101101200220121 is a wasteful number, since it uses less digits than its factorization.
101101200220121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 115449.
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 101101200220121 its reverse (121022002101101), we get a palindrome (222123202321222).
The spelling of 101101200220121 in words is "one hundred one trillion, one hundred one billion, two hundred million, two hundred twenty thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •