Base | Representation |
---|---|
bin | 11011100011101101011011… |
… | …101110011000011001001101 |
3 | 120220010201112111000221011022 |
4 | 123203231123232120121031 |
5 | 111341230100034323041 |
6 | 1105435023340003525 |
7 | 34346333146255124 |
oct | 3343553356303115 |
9 | 526121474027138 |
10 | 121201221011021 |
11 | 35689170607a18 |
12 | 117157378305a5 |
13 | 52822c29844b8 |
14 | 21d02557d6abb |
15 | e02ac662c24b |
hex | 6e3b5bb9864d |
121201221011021 has 8 divisors (see below), whose sum is σ = 133127199280320. Its totient is φ = 109829939405472.
The previous prime is 121201221011009. The next prime is 121201221011027. The reversal of 121201221011021 is 120110122102121.
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 121201221011021 - 210 = 121201221009997 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (121201221011027) 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, 138674165480 + ... + 138674166353.
It is an arithmetic number, because the mean of its divisors is an integer number (16640899910040).
Almost surely, 2121201221011021 is an apocalyptic number.
It is an amenable number.
121201221011021 is a deficient number, since it is larger than the sum of its proper divisors (11925978269299).
121201221011021 is a wasteful number, since it uses less digits than its factorization.
121201221011021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 277348331875.
The product of its (nonzero) digits is 32, while the sum is 17.
Adding to 121201221011021 its reverse (120110122102121), we get a palindrome (241311343113142).
The spelling of 121201221011021 in words is "one hundred twenty-one trillion, two hundred one billion, two hundred twenty-one million, eleven thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •