Base | Representation |
---|---|
bin | 1010001100101000101101… |
… | …0000111101010110111011 |
3 | 1110200212122120111112121000 |
4 | 2203022023100331112323 |
5 | 2432200041441334321 |
6 | 35502451502020043 |
7 | 2235024540021306 |
oct | 243121320752673 |
9 | 43625576445530 |
10 | 11212201121211 |
11 | 3633082260062 |
12 | 1310bbb577623 |
13 | 6343c946547c |
14 | 2aa95dc69b3d |
15 | 1469c5d7a826 |
hex | a328b43d5bb |
11212201121211 has 16 divisors (see below), whose sum is σ = 16620456650400. Its totient is φ = 7470396002304.
The previous prime is 11212201121183. The next prime is 11212201121267. The reversal of 11212201121211 is 11212110221211.
It is a happy number.
11212201121211 is a `hidden beast` number, since 1 + 121 + 220 + 112 + 1 + 211 = 666.
It is not a de Polignac number, because 11212201121211 - 25 = 11212201121179 is a prime.
It is not an unprimeable number, because it can be changed into a prime (11212201121281) 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 15 ways as a sum of consecutive naturals, for example, 122307366 + ... + 122399003.
It is an arithmetic number, because the mean of its divisors is an integer number (1038778540650).
Almost surely, 211212201121211 is an apocalyptic number.
11212201121211 is a deficient number, since it is larger than the sum of its proper divisors (5408255529189).
11212201121211 is a wasteful number, since it uses less digits than its factorization.
11212201121211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 244708075 (or 244708069 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 18.
Adding to 11212201121211 its reverse (11212110221211), we get a palindrome (22424311342422).
The spelling of 11212201121211 in words is "eleven trillion, two hundred twelve billion, two hundred one million, one hundred twenty-one thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •