Base | Representation |
---|---|
bin | 111000011001000111… |
… | …1111011100100000101 |
3 | 102120120211000011120221 |
4 | 1300302033323210011 |
5 | 3441004120334341 |
6 | 131344502424341 |
7 | 11515011021544 |
oct | 1606217734405 |
9 | 376524004527 |
10 | 121102121221 |
11 | 473a4a99104 |
12 | 1b578a320b1 |
13 | b55c62b6c3 |
14 | 5c0b87815b |
15 | 323bb09ed1 |
hex | 1c323fb905 |
121102121221 has 2 divisors, whose sum is σ = 121102121222. Its totient is φ = 121102121220.
The previous prime is 121102121167. The next prime is 121102121291. The reversal of 121102121221 is 122121201121.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 77416941121 + 43685180100 = 278239^2 + 209010^2 .
It is a cyclic number.
It is not a de Polignac number, because 121102121221 - 29 = 121102120709 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 121102121195 and 121102121204.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (121102121291) 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, 60551060610 + 60551060611.
It is an arithmetic number, because the mean of its divisors is an integer number (60551060611).
Almost surely, 2121102121221 is an apocalyptic number.
It is an amenable number.
121102121221 is a deficient number, since it is larger than the sum of its proper divisors (1).
121102121221 is an equidigital number, since it uses as much as digits as its factorization.
121102121221 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 121102121221 its reverse (122121201121), we get a palindrome (243223322342).
The spelling of 121102121221 in words is "one hundred twenty-one billion, one hundred two million, one hundred twenty-one thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •