Base | Representation |
---|---|
bin | 10110111111001101110000… |
… | …011101101011101111111111 |
3 | 111020222011200000122022112111 |
4 | 112333031300131223233333 |
5 | 101222420044213310421 |
6 | 555005114140514451 |
7 | 30203213023613266 |
oct | 2677156035535777 |
9 | 436864600568474 |
10 | 101101122010111 |
11 | 2a239821745a53 |
12 | b40a0a924ba27 |
13 | 4454a4450a212 |
14 | 1ad746b3075dd |
15 | ba4d13a02ee1 |
hex | 5bf37076bbff |
101101122010111 has 2 divisors, whose sum is σ = 101101122010112. Its totient is φ = 101101122010110.
The previous prime is 101101122010093. The next prime is 101101122010157. The reversal of 101101122010111 is 111010221101101.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 101101122010111 - 215 = 101101121977343 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 101101122010091 and 101101122010100.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (101101122010181) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50550561005055 + 50550561005056.
It is an arithmetic number, because the mean of its divisors is an integer number (50550561005056).
Almost surely, 2101101122010111 is an apocalyptic number.
101101122010111 is a deficient number, since it is larger than the sum of its proper divisors (1).
101101122010111 is an equidigital number, since it uses as much as digits as its factorization.
101101122010111 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4, while the sum is 13.
Adding to 101101122010111 its reverse (111010221101101), we get a palindrome (212111343111212).
The spelling of 101101122010111 in words is "one hundred one trillion, one hundred one billion, one hundred twenty-two million, ten thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •