Base | Representation |
---|---|
bin | 111000011100101010… |
… | …1111000000001111001 |
3 | 102120220002220221101121 |
4 | 1300321111320001321 |
5 | 3441230101320441 |
6 | 131404353145241 |
7 | 11520654343243 |
oct | 1607125700171 |
9 | 376802827347 |
10 | 121221120121 |
11 | 47456186802 |
12 | 1b5b085b221 |
13 | b57b194a5a |
14 | 5c1d5b3093 |
15 | 32472b3dd1 |
hex | 1c39578079 |
121221120121 has 2 divisors, whose sum is σ = 121221120122. Its totient is φ = 121221120120.
The previous prime is 121221120101. The next prime is 121221120169. The reversal of 121221120121 is 121021122121.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 107194034025 + 14027086096 = 327405^2 + 118436^2 .
It is a cyclic number.
It is not a de Polignac number, because 121221120121 - 219 = 121220595833 is a prime.
It is a super-2 number, since 2×1212211201212 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 121221120095 and 121221120104.
It is not a weakly prime, because it can be changed into another prime (121221120101) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 60610560060 + 60610560061.
It is an arithmetic number, because the mean of its divisors is an integer number (60610560061).
Almost surely, 2121221120121 is an apocalyptic number.
It is an amenable number.
121221120121 is a deficient number, since it is larger than the sum of its proper divisors (1).
121221120121 is an equidigital number, since it uses as much as digits as its factorization.
121221120121 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 121221120121 its reverse (121021122121), we get a palindrome (242242242242).
The spelling of 121221120121 in words is "one hundred twenty-one billion, two hundred twenty-one million, one hundred twenty thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •