Base | Representation |
---|---|
bin | 111000011001101100… |
… | …0000001100011011001 |
3 | 102120122010120100000012 |
4 | 1300303120001203121 |
5 | 3441023440120441 |
6 | 131350415451305 |
7 | 11515330453433 |
oct | 1606330014331 |
9 | 376563510005 |
10 | 121121020121 |
11 | 47404727132 |
12 | 1b583226b35 |
13 | b56351789a |
14 | 5c10197653 |
15 | 323d5de9eb |
hex | 1c336018d9 |
121121020121 has 8 divisors (see below), whose sum is σ = 122332327488. Its totient is φ = 119909950000.
The previous prime is 121121020091. The next prime is 121121020169. The reversal of 121121020121 is 121020121121.
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 121121020121 - 214 = 121121003737 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 121121020096 and 121121020105.
It is not an unprimeable number, because it can be changed into a prime (121121020021) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1074596 + ... + 1181946.
It is an arithmetic number, because the mean of its divisors is an integer number (15291540936).
Almost surely, 2121121020121 is an apocalyptic number.
It is an amenable number.
121121020121 is a deficient number, since it is larger than the sum of its proper divisors (1211307367).
121121020121 is a wasteful number, since it uses less digits than its factorization.
121121020121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 118623.
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 121121020121 its reverse (121020121121), we get a palindrome (242141141242).
It can be divided in two parts, 121 and 121020121, that multiplied together give a palindrome (14643434641).
The spelling of 121121020121 in words is "one hundred twenty-one billion, one hundred twenty-one million, twenty thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •