Base | Representation |
---|---|
bin | 110000001110110010000111… |
… | …101011110011001110010100 |
3 | 1000211001200021100022222001111 |
4 | 300032302013223303032110 |
5 | 210300402101013033022 |
6 | 2031051320205104404 |
7 | 62452213623512332 |
oct | 6016620753631624 |
9 | 1024050240288044 |
10 | 212122121221012 |
11 | 61652539464a92 |
12 | 1b95a831258104 |
13 | 9149051473a92 |
14 | 3a54aa055ab52 |
15 | 197cbb32c0477 |
hex | c0ec87af3394 |
212122121221012 has 6 divisors (see below), whose sum is σ = 371213712136778. Its totient is φ = 106061060610504.
The previous prime is 212122121221007. The next prime is 212122121221067. The reversal of 212122121221012 is 210122121221212.
212122121221012 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in only one way, i.e., 197014798150416 + 15107323070596 = 14036196^2 + 3886814^2 .
It is a super-2 number, since 2×2121221212210122 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 26515265152623 + ... + 26515265152630.
Almost surely, 2212122121221012 is an apocalyptic number.
It is an amenable number.
212122121221012 is a deficient number, since it is larger than the sum of its proper divisors (159091590915766).
212122121221012 is a wasteful number, since it uses less digits than its factorization.
212122121221012 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 53030530305257 (or 53030530305255 counting only the distinct ones).
The product of its (nonzero) digits is 256, while the sum is 22.
Adding to 212122121221012 its reverse (210122121221212), we get a palindrome (422244242442224).
The spelling of 212122121221012 in words is "two hundred twelve trillion, one hundred twenty-two billion, one hundred twenty-one million, two hundred twenty-one thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •