Base | Representation |
---|---|
bin | 111000011100101010… |
… | …1110011101000101001 |
3 | 102120220002220000200221 |
4 | 1300321111303220221 |
5 | 3441230100231441 |
6 | 131404352530041 |
7 | 11520654236620 |
oct | 1607125635051 |
9 | 376802800627 |
10 | 121221102121 |
11 | 47456174229 |
12 | 1b5b0850921 |
13 | b57b1897c2 |
14 | 5c1d5aa6b7 |
15 | 32472ad8d1 |
hex | 1c39573a29 |
121221102121 has 8 divisors (see below), whose sum is σ = 139367975040. Its totient is φ = 103281622368.
The previous prime is 121221102097. The next prime is 121221102143. The reversal of 121221102121 is 121201122121.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 121221102121 - 229 = 120684231209 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 121221102095 and 121221102104.
It is not an unprimeable number, because it can be changed into a prime (121221102161) 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 in 7 ways as a sum of consecutive naturals, for example, 51847036 + ... + 51849373.
It is an arithmetic number, because the mean of its divisors is an integer number (17420996880).
Almost surely, 2121221102121 is an apocalyptic number.
It is an amenable number.
121221102121 is a deficient number, since it is larger than the sum of its proper divisors (18146872919).
121221102121 is a wasteful number, since it uses less digits than its factorization.
121221102121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 103696583.
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 121221102121 its reverse (121201122121), we get a palindrome (242422224242).
The spelling of 121221102121 in words is "one hundred twenty-one billion, two hundred twenty-one million, one hundred two thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •