Base | Representation |
---|---|
bin | 11011100010011001011011… |
… | …010101100110100011001101 |
3 | 120212211002201020022002002211 |
4 | 123202121123111212203031 |
5 | 111333240332132432224 |
6 | 1105325345023350421 |
7 | 34336660661115103 |
oct | 3342313325464315 |
9 | 525732636262084 |
10 | 121111020202189 |
11 | 35653993601216 |
12 | 11700163752411 |
13 | 5276949383a34 |
14 | 21c9b39d85c73 |
15 | e00597836894 |
hex | 6e265b5668cd |
121111020202189 has 2 divisors, whose sum is σ = 121111020202190. Its totient is φ = 121111020202188.
The previous prime is 121111020202153. The next prime is 121111020202301. The reversal of 121111020202189 is 981202020111121.
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., 73190249316900 + 47920770885289 = 8555130^2 + 6922483^2 .
It is a cyclic number.
It is not a de Polignac number, because 121111020202189 - 27 = 121111020202061 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 121111020202189.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (121111020202129) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 60555510101094 + 60555510101095.
It is an arithmetic number, because the mean of its divisors is an integer number (60555510101095).
Almost surely, 2121111020202189 is an apocalyptic number.
It is an amenable number.
121111020202189 is a deficient number, since it is larger than the sum of its proper divisors (1).
121111020202189 is an equidigital number, since it uses as much as digits as its factorization.
121111020202189 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1152, while the sum is 31.
The spelling of 121111020202189 in words is "one hundred twenty-one trillion, one hundred eleven billion, twenty million, two hundred two thousand, one hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •