Base | Representation |
---|---|
bin | 10011101010111110… |
… | …110101100110100101 |
3 | 2000112001011110020222 |
4 | 103222332311212211 |
5 | 321224241211323 |
6 | 13411534134125 |
7 | 1345266552536 |
oct | 235276654645 |
9 | 60461143228 |
10 | 21122210213 |
11 | 8a59a34185 |
12 | 4115951345 |
13 | 1cb8033a50 |
14 | 104536668d |
15 | 83953c9c8 |
hex | 4eafb59a5 |
21122210213 has 8 divisors (see below), whose sum is σ = 23275996128. Its totient is φ = 19043995824.
The previous prime is 21122210209. The next prime is 21122210297. The reversal of 21122210213 is 31201222112.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 21122210213 - 22 = 21122210209 is a prime.
It is a super-2 number, since 2×211222102132 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 21122210191 and 21122210200.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21122210413) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 18892295 + ... + 18893412.
It is an arithmetic number, because the mean of its divisors is an integer number (2909499516).
Almost surely, 221122210213 is an apocalyptic number.
It is an amenable number.
21122210213 is a deficient number, since it is larger than the sum of its proper divisors (2153785915).
21122210213 is a wasteful number, since it uses less digits than its factorization.
21122210213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 37785763.
The product of its (nonzero) digits is 96, while the sum is 17.
Adding to 21122210213 its reverse (31201222112), we get a palindrome (52323432325).
The spelling of 21122210213 in words is "twenty-one billion, one hundred twenty-two million, two hundred ten thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •