Base | Representation |
---|---|
bin | 111000011001001010… |
… | …0011101110110001101 |
3 | 102120120220020120120222 |
4 | 1300302110131312031 |
5 | 3441004421411341 |
6 | 131344544121125 |
7 | 11515024103165 |
oct | 1606224356615 |
9 | 376526216528 |
10 | 121103310221 |
11 | 473a5730453 |
12 | 1b5793061a5 |
13 | b55c95695a |
14 | 5c0baa75a5 |
15 | 323bc9244b |
hex | 1c3251dd8d |
121103310221 has 2 divisors, whose sum is σ = 121103310222. Its totient is φ = 121103310220.
The previous prime is 121103310173. The next prime is 121103310233. The reversal of 121103310221 is 122013301121.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 86650753225 + 34452556996 = 294365^2 + 185614^2 .
It is a cyclic number.
It is not a de Polignac number, because 121103310221 - 26 = 121103310157 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 121103310221.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (121103310271) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 60551655110 + 60551655111.
It is an arithmetic number, because the mean of its divisors is an integer number (60551655111).
Almost surely, 2121103310221 is an apocalyptic number.
It is an amenable number.
121103310221 is a deficient number, since it is larger than the sum of its proper divisors (1).
121103310221 is an equidigital number, since it uses as much as digits as its factorization.
121103310221 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 17.
Adding to 121103310221 its reverse (122013301121), we get a palindrome (243116611342).
The spelling of 121103310221 in words is "one hundred twenty-one billion, one hundred three million, three hundred ten thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •