Base | Representation |
---|---|
bin | 110000001110101000101101… |
… | …101010100011111011111101 |
3 | 1000211000201012110000012022102 |
4 | 300032220231222203323331 |
5 | 210300220404334342341 |
6 | 2031042530042354445 |
7 | 62451405421245431 |
oct | 6016505552437375 |
9 | 1024021173005272 |
10 | 212112021012221 |
11 | 616492261266a0 |
12 | 1b9588927bba25 |
13 | 9148101a9ba85 |
14 | 3a543c2d909c1 |
15 | 197c7c171ac9b |
hex | c0ea2daa3efd |
212112021012221 has 16 divisors (see below), whose sum is σ = 232281765720000. Its totient is φ = 192090246307200.
The previous prime is 212112021012169. The next prime is 212112021012239. The reversal of 212112021012221 is 122210120211212.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-212112021012221 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 212112021012193 and 212112021012202.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (212112021012121) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 21729905 + ... + 29940153.
It is an arithmetic number, because the mean of its divisors is an integer number (14517610357500).
Almost surely, 2212112021012221 is an apocalyptic number.
It is an amenable number.
212112021012221 is a deficient number, since it is larger than the sum of its proper divisors (20169744707779).
212112021012221 is a wasteful number, since it uses less digits than its factorization.
212112021012221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8219260.
The product of its (nonzero) digits is 128, while the sum is 20.
Adding to 212112021012221 its reverse (122210120211212), we get a palindrome (334322141223433).
The spelling of 212112021012221 in words is "two hundred twelve trillion, one hundred twelve billion, twenty-one million, twelve thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •