Base | Representation |
---|---|
bin | 11011100000111101010011… |
… | …010110100111011000101101 |
3 | 120212110122101110020212111222 |
4 | 123200331103112213120231 |
5 | 111330130241103032341 |
6 | 1105212105303153125 |
7 | 34326556461231413 |
oct | 3340752326473055 |
9 | 525418343225458 |
10 | 121012102002221 |
11 | 35615a4288a531 |
12 | 116a4b581457a5 |
13 | 526a513a21c71 |
14 | 21c50348872b3 |
15 | decc0858a44b |
hex | 6e0f535a762d |
121012102002221 has 16 divisors (see below), whose sum is σ = 129393930169728. Its totient is φ = 112892081702400.
The previous prime is 121012102002203. The next prime is 121012102002257. The reversal of 121012102002221 is 122200201210121.
It is a cyclic number.
It is not a de Polignac number, because 121012102002221 - 26 = 121012102002157 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 121012102002221.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (121012102002721) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 17127500 + ... + 23138181.
It is an arithmetic number, because the mean of its divisors is an integer number (8087120635608).
Almost surely, 2121012102002221 is an apocalyptic number.
It is an amenable number.
121012102002221 is a deficient number, since it is larger than the sum of its proper divisors (8381828167507).
121012102002221 is a wasteful number, since it uses less digits than its factorization.
121012102002221 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 40268932.
The product of its (nonzero) digits is 64, while the sum is 17.
Adding to 121012102002221 its reverse (122200201210121), we get a palindrome (243212303212342).
The spelling of 121012102002221 in words is "one hundred twenty-one trillion, twelve billion, one hundred two million, two thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •