Base | Representation |
---|---|
bin | 111111001111011… |
… | …0101001001010101 |
3 | 12110212221100011012 |
4 | 1332132311021111 |
5 | 13321213324341 |
6 | 550322022005 |
7 | 103404540431 |
oct | 17636651125 |
9 | 5425840135 |
10 | 2122011221 |
11 | 999902490 |
12 | 4b27a7905 |
13 | 27a826855 |
14 | 161b799c1 |
15 | c64640eb |
hex | 7e7b5255 |
2122011221 has 16 divisors (see below), whose sum is σ = 2341319040. Its totient is φ = 1907220480.
The previous prime is 2122011217. The next prime is 2122011233. The reversal of 2122011221 is 1221102212.
It is not a de Polignac number, because 2122011221 - 22 = 2122011217 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2122011196 and 2122011205.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2122011271) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 384560 + ... + 390038.
It is an arithmetic number, because the mean of its divisors is an integer number (146332440).
Almost surely, 22122011221 is an apocalyptic number.
It is an amenable number.
2122011221 is a deficient number, since it is larger than the sum of its proper divisors (219307819).
2122011221 is a wasteful number, since it uses less digits than its factorization.
2122011221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5884.
The product of its (nonzero) digits is 32, while the sum is 14.
The square root of 2122011221 is about 46065.2930197996. The cubic root of 2122011221 is about 1285.0377680209.
Adding to 2122011221 its reverse (1221102212), we get a palindrome (3343113433).
Subtracting from 2122011221 its reverse (1221102212), we obtain a palindrome (900909009).
The spelling of 2122011221 in words is "two billion, one hundred twenty-two million, eleven thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •