Base | Representation |
---|---|
bin | 101111111111111100000011… |
… | …101110001101101110110100 |
3 | 1000200110011011100022020002220 |
4 | 233333330003232031232310 |
5 | 210132143344000342322 |
6 | 2024550530415202340 |
7 | 62315421232352061 |
oct | 5777740356155664 |
9 | 1020404140266086 |
10 | 211102000012212 |
11 | 61299945653111 |
12 | 1b814b948163b0 |
13 | 90a3aaa67243a |
14 | 3a1b569ab9c68 |
15 | 19613aa34955c |
hex | bfff03b8dbb4 |
211102000012212 has 24 divisors (see below), whose sum is σ = 501865132106016. Its totient is φ = 69039647802528.
The previous prime is 211102000012181. The next prime is 211102000012291. The reversal of 211102000012212 is 212210000201112.
It is a junction number, because it is equal to n+sod(n) for n = 211102000012191 and 211102000012200.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 165960691198 + ... + 165960692469.
It is an arithmetic number, because the mean of its divisors is an integer number (20911047171084).
Almost surely, 2211102000012212 is an apocalyptic number.
It is an amenable number.
211102000012212 is an abundant number, since it is smaller than the sum of its proper divisors (290763132093804).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
211102000012212 is a wasteful number, since it uses less digits than its factorization.
211102000012212 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 331921383727 (or 331921383725 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 211102000012212 its reverse (212210000201112), we get a palindrome (423312000213324).
The spelling of 211102000012212 in words is "two hundred eleven trillion, one hundred two billion, twelve thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.805 sec. • engine limits •