Base | Representation |
---|---|
bin | 1001100110101111001011… |
… | …11100101111100001110011 |
3 | 2202210021010021111212122200 |
4 | 10303113211330233201303 |
5 | 10232031242244201321 |
6 | 112531224342034243 |
7 | 4310013051340035 |
oct | 463274574574163 |
9 | 82707107455580 |
10 | 21122212100211 |
11 | 6803975091742 |
12 | 2451762118983 |
13 | ba2a7bb43a71 |
14 | 53046b717c55 |
15 | 2696858aed26 |
hex | 1335e5f2f873 |
21122212100211 has 12 divisors (see below), whose sum is σ = 31334452785792. Its totient is φ = 13700894335056.
The previous prime is 21122212100191. The next prime is 21122212100219. The reversal of 21122212100211 is 11200121222112.
21122212100211 is a `hidden beast` number, since 21 + 1 + 2 + 221 + 210 + 0 + 211 = 666.
It is not a de Polignac number, because 21122212100211 - 227 = 21122077882483 is a prime.
It is a super-2 number, since 2×211222121002112 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (21122212100219) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 31715032851 + ... + 31715033516.
It is an arithmetic number, because the mean of its divisors is an integer number (2611204398816).
Almost surely, 221122212100211 is an apocalyptic number.
21122212100211 is a deficient number, since it is larger than the sum of its proper divisors (10212240685581).
21122212100211 is a wasteful number, since it uses less digits than its factorization.
21122212100211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 63430066410 (or 63430066407 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 18.
Adding to 21122212100211 its reverse (11200121222112), we get a palindrome (32322333322323).
The spelling of 21122212100211 in words is "twenty-one trillion, one hundred twenty-two billion, two hundred twelve million, one hundred thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •