Base | Representation |
---|---|
bin | 11001001010101… |
… | …11001101110100 |
3 | 112201021001120202 |
4 | 30211113031310 |
5 | 413021333022 |
6 | 32541020032 |
7 | 5142333104 |
oct | 1445271564 |
9 | 481231522 |
10 | 211121012 |
11 | a9199383 |
12 | 5a854618 |
13 | 3497c19b |
14 | 20079204 |
15 | 13804592 |
hex | c957374 |
211121012 has 6 divisors (see below), whose sum is σ = 369461778. Its totient is φ = 105560504.
The previous prime is 211121003. The next prime is 211121021. The reversal of 211121012 is 210121112.
211121012 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is an interprime number because it is at equal distance from previous prime (211121003) and next prime (211121021).
It can be written as a sum of positive squares in only one way, i.e., 129868816 + 81252196 = 11396^2 + 9014^2 .
It is a junction number, because it is equal to n+sod(n) for n = 211120984 and 211121002.
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, 26390123 + ... + 26390130.
It is an arithmetic number, because the mean of its divisors is an integer number (61576963).
Almost surely, 2211121012 is an apocalyptic number.
It is an amenable number.
211121012 is a deficient number, since it is larger than the sum of its proper divisors (158340766).
211121012 is a wasteful number, since it uses less digits than its factorization.
211121012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 52780257 (or 52780255 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 11.
The square root of 211121012 is about 14530.0038540945. The cubic root of 211121012 is about 595.4479709060.
Adding to 211121012 its reverse (210121112), we get a palindrome (421242124).
The spelling of 211121012 in words is "two hundred eleven million, one hundred twenty-one thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •