Base | Representation |
---|---|
bin | 10011000001011000… |
… | …00111011101011101 |
3 | 222100200220001101120 |
4 | 21200230013131131 |
5 | 131403300042341 |
6 | 4405201001153 |
7 | 511031343633 |
oct | 114054073535 |
9 | 28320801346 |
10 | 10212112221 |
11 | 4370520073 |
12 | 1b900231b9 |
13 | c6992586c |
14 | 6cc3b9353 |
15 | 3eb80b066 |
hex | 260b0775d |
10212112221 has 16 divisors (see below), whose sum is σ = 13993089600. Its totient is φ = 6619840128.
The previous prime is 10212112213. The next prime is 10212112223. The reversal of 10212112221 is 12221121201.
10212112221 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 10212112221 - 23 = 10212112213 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 10212112221.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10212112223) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 150010 + ... + 207188.
It is an arithmetic number, because the mean of its divisors is an integer number (874568100).
Almost surely, 210212112221 is an apocalyptic number.
It is an amenable number.
10212112221 is a deficient number, since it is larger than the sum of its proper divisors (3780977379).
10212112221 is a wasteful number, since it uses less digits than its factorization.
10212112221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 58828.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 10212112221 its reverse (12221121201), we get a palindrome (22433233422).
The spelling of 10212112221 in words is "ten billion, two hundred twelve million, one hundred twelve thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •