Base | Representation |
---|---|
bin | 11011100010010001001110… |
… | …111111101111110111000101 |
3 | 120212210021000011012200011101 |
4 | 123202101032333233313011 |
5 | 111333114323120240343 |
6 | 1105321332053340101 |
7 | 34336226661665233 |
oct | 3342211677576705 |
9 | 525707004180141 |
10 | 121102223211973 |
11 | 35650189969273 |
12 | 116ba509637631 |
13 | 5275b769a2993 |
14 | 21c95438d7953 |
15 | e002303aae4d |
hex | 6e244efefdc5 |
121102223211973 has 2 divisors, whose sum is σ = 121102223211974. Its totient is φ = 121102223211972.
The previous prime is 121102223211943. The next prime is 121102223212001. The reversal of 121102223211973 is 379112322201121.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 120836331383364 + 265891828609 = 10992558^2 + 515647^2 .
It is a cyclic number.
It is not a de Polignac number, because 121102223211973 - 29 = 121102223211461 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (121102223211943) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 60551111605986 + 60551111605987.
It is an arithmetic number, because the mean of its divisors is an integer number (60551111605987).
Almost surely, 2121102223211973 is an apocalyptic number.
It is an amenable number.
121102223211973 is a deficient number, since it is larger than the sum of its proper divisors (1).
121102223211973 is an equidigital number, since it uses as much as digits as its factorization.
121102223211973 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 18144, while the sum is 37.
The spelling of 121102223211973 in words is "one hundred twenty-one trillion, one hundred two billion, two hundred twenty-three million, two hundred eleven thousand, nine hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •