Base | Representation |
---|---|
bin | 111000011100000100… |
… | …1100101001100010101 |
3 | 102120211201021211102011 |
4 | 1300320021211030111 |
5 | 3441204441320041 |
6 | 131402400344221 |
7 | 11520322344022 |
oct | 1607011451425 |
9 | 376751254364 |
10 | 121201120021 |
11 | 474459663a3 |
12 | 1b5a6015071 |
13 | b576cb1587 |
14 | 5c1aa88549 |
15 | 3245662e81 |
hex | 1c38265315 |
121201120021 has 8 divisors (see below), whose sum is σ = 121323644640. Its totient is φ = 121078643568.
The previous prime is 121201119973. The next prime is 121201120037. The reversal of 121201120021 is 120021102121.
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 121201120021 - 29 = 121201119509 is a prime.
It is a super-2 number, since 2×1212011200212 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 121201119983 and 121201120010.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (121201120721) 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, 6930130 + ... + 6947596.
It is an arithmetic number, because the mean of its divisors is an integer number (15165455580).
Almost surely, 2121201120021 is an apocalyptic number.
It is an amenable number.
121201120021 is a deficient number, since it is larger than the sum of its proper divisors (122524619).
121201120021 is a wasteful number, since it uses less digits than its factorization.
121201120021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 24083.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 121201120021 its reverse (120021102121), we get a palindrome (241222222142).
The spelling of 121201120021 in words is "one hundred twenty-one billion, two hundred one million, one hundred twenty thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •