Base | Representation |
---|---|
bin | 111000011100101100… |
… | …1010100000000000001 |
3 | 102120220011121201022222 |
4 | 1300321121110000001 |
5 | 3441230314133441 |
6 | 131404424340425 |
7 | 11520665115125 |
oct | 1607131240001 |
9 | 376804551288 |
10 | 121222021121 |
11 | 47456741733 |
12 | 1b5b1014715 |
13 | b57b41bba6 |
14 | 5c1d769585 |
15 | 32473e0d4b |
hex | 1c39654001 |
121222021121 has 2 divisors, whose sum is σ = 121222021122. Its totient is φ = 121222021120.
The previous prime is 121222021013. The next prime is 121222021139. The reversal of 121222021121 is 121120222121.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 100099468225 + 21122552896 = 316385^2 + 145336^2 .
It is a cyclic number.
It is not a de Polignac number, because 121222021121 - 210 = 121222020097 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 121222021121.
It is not a weakly prime, because it can be changed into another prime (121222029121) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 60611010560 + 60611010561.
It is an arithmetic number, because the mean of its divisors is an integer number (60611010561).
Almost surely, 2121222021121 is an apocalyptic number.
It is an amenable number.
121222021121 is a deficient number, since it is larger than the sum of its proper divisors (1).
121222021121 is an equidigital number, since it uses as much as digits as its factorization.
121222021121 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 64, while the sum is 17.
Adding to 121222021121 its reverse (121120222121), we get a palindrome (242342243242).
The spelling of 121222021121 in words is "one hundred twenty-one billion, two hundred twenty-two million, twenty-one thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •