Base | Representation |
---|---|
bin | 11110111000010111101… |
… | …011110101101010111101 |
3 | 21111212112120122011011202 |
4 | 132320113223311222331 |
5 | 234232040432242341 |
6 | 4302515012025245 |
7 | 306213615453110 |
oct | 36702753655275 |
9 | 7455476564152 |
10 | 2122111212221 |
11 | 748a895019a0 |
12 | 2a3342902225 |
13 | 125163c63b30 |
14 | 749d4360577 |
15 | 3a3034b279b |
hex | 1ee17af5abd |
2122111212221 has 32 divisors (see below), whose sum is σ = 2868391008000. Its totient is φ = 1516149319680.
The previous prime is 2122111212211. The next prime is 2122111212251. The reversal of 2122111212221 is 1222121112212.
It is a cyclic number.
It is not a de Polignac number, because 2122111212221 - 26 = 2122111212157 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 2122111212193 and 2122111212202.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2122111212211) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 6964916 + ... + 7263213.
It is an arithmetic number, because the mean of its divisors is an integer number (89637219000).
Almost surely, 22122111212221 is an apocalyptic number.
It is an amenable number.
2122111212221 is a deficient number, since it is larger than the sum of its proper divisors (746279795779).
2122111212221 is a wasteful number, since it uses less digits than its factorization.
2122111212221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14228309.
The product of its digits is 128, while the sum is 20.
Adding to 2122111212221 its reverse (1222121112212), we get a palindrome (3344232324433).
It can be divided in two parts, 2122111 and 212221, that added together give a palindrome (2334332).
The spelling of 2122111212221 in words is "two trillion, one hundred twenty-two billion, one hundred eleven million, two hundred twelve thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •