Base | Representation |
---|---|
bin | 11011100000111101010011… |
… | …111101100110001101011101 |
3 | 120212110122102011111001002001 |
4 | 123200331103331212031131 |
5 | 111330130301212033041 |
6 | 1105212110310202301 |
7 | 34326556644132010 |
oct | 3340752375461535 |
9 | 525418364431061 |
10 | 121012112221021 |
11 | 35615a4862a01a |
12 | 116a4b5b653391 |
13 | 526a515b8c2a8 |
14 | 21c5035d87377 |
15 | decc09408131 |
hex | 6e0f53f6635d |
121012112221021 has 16 divisors (see below), whose sum is σ = 147243857080320. Its totient is φ = 97083861776640.
The previous prime is 121012112221009. The next prime is 121012112221073. The reversal of 121012112221021 is 120122211210121.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 121012112221021 - 213 = 121012112212829 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 121012112221021.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (121012112221001) 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, 2809117981 + ... + 2809161058.
It is an arithmetic number, because the mean of its divisors is an integer number (9202741067520).
Almost surely, 2121012112221021 is an apocalyptic number.
It is an amenable number.
121012112221021 is a deficient number, since it is larger than the sum of its proper divisors (26231744859299).
121012112221021 is a wasteful number, since it uses less digits than its factorization.
121012112221021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5618279244.
The product of its (nonzero) digits is 64, while the sum is 19.
Adding to 121012112221021 its reverse (120122211210121), we get a palindrome (241134323431142).
The spelling of 121012112221021 in words is "one hundred twenty-one trillion, twelve billion, one hundred twelve million, two hundred twenty-one thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •