Base | Representation |
---|---|
bin | 1011000001100110011011… |
… | …0001101011111001100011 |
3 | 1120220212022112012000001200 |
4 | 2300121212301223321203 |
5 | 3042102101213311321 |
6 | 41440454224332243 |
7 | 2360536324662423 |
oct | 260314661537143 |
9 | 46825275160050 |
10 | 12122122010211 |
11 | 3953a65940674 |
12 | 1439422174083 |
13 | 69c15a4001a5 |
14 | 2dc9dcaa0483 |
15 | 1604ce339d26 |
hex | b0666c6be63 |
12122122010211 has 24 divisors (see below), whose sum is σ = 17610356291424. Its totient is φ = 8035088855040.
The previous prime is 12122122010203. The next prime is 12122122010233. The reversal of 12122122010211 is 11201022122121.
12122122010211 is a `hidden beast` number, since 1 + 2 + 1 + 221 + 220 + 10 + 211 = 666.
It is not a de Polignac number, because 12122122010211 - 23 = 12122122010203 is a prime.
It is not an unprimeable number, because it can be changed into a prime (12122122010281) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 3592351 + ... + 6095016.
It is an arithmetic number, because the mean of its divisors is an integer number (733764845476).
Almost surely, 212122122010211 is an apocalyptic number.
12122122010211 is a deficient number, since it is larger than the sum of its proper divisors (5488234281213).
12122122010211 is a wasteful number, since it uses less digits than its factorization.
12122122010211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9688171 (or 9688168 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 18.
Adding to 12122122010211 its reverse (11201022122121), we get a palindrome (23323144132332).
The spelling of 12122122010211 in words is "twelve trillion, one hundred twenty-two billion, one hundred twenty-two million, ten thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •