Base | Representation |
---|---|
bin | 101111111111111100001001… |
… | …110000001110000011010101 |
3 | 1000200110011102101201011011211 |
4 | 233333330021300032003111 |
5 | 210132144100401413414 |
6 | 2024550544432101421 |
7 | 62315423601425326 |
oct | 5777741160160325 |
9 | 1020404371634154 |
10 | 211102101201109 |
11 | 612999977868a8 |
12 | 1b815002694871 |
13 | 90a3ac5611121 |
14 | 3a1b5792da44d |
15 | 19613b41863c4 |
hex | bfff09c0e0d5 |
211102101201109 has 2 divisors, whose sum is σ = 211102101201110. Its totient is φ = 211102101201108.
The previous prime is 211102101201097. The next prime is 211102101201179. The reversal of 211102101201109 is 901102101201112.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 173159544180100 + 37942557021009 = 13159010^2 + 6159753^2 .
It is a cyclic number.
It is not a de Polignac number, because 211102101201109 - 211 = 211102101199061 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 211102101201109.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (211102101201179) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 105551050600554 + 105551050600555.
It is an arithmetic number, because the mean of its divisors is an integer number (105551050600555).
Almost surely, 2211102101201109 is an apocalyptic number.
It is an amenable number.
211102101201109 is a deficient number, since it is larger than the sum of its proper divisors (1).
211102101201109 is an equidigital number, since it uses as much as digits as its factorization.
211102101201109 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 72, while the sum is 22.
The spelling of 211102101201109 in words is "two hundred eleven trillion, one hundred two billion, one hundred one million, two hundred one thousand, one hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •