Base | Representation |
---|---|
bin | 110000000001100000110110… |
… | …010000110011000010011000 |
3 | 1000200211111111112021222101110 |
4 | 300001200312100303002120 |
5 | 210140432013330333422 |
6 | 2025112345254420320 |
7 | 62326302125166414 |
oct | 6001406620630230 |
9 | 1020744445258343 |
10 | 211210222121112 |
11 | 6133083016a335 |
12 | 1b831b580616a0 |
13 | 90b1066720576 |
14 | 3a228b4addd44 |
15 | 19640e130460c |
hex | c01836433098 |
211210222121112 has 32 divisors (see below), whose sum is σ = 528026301204480. Its totient is φ = 70403307920160.
The previous prime is 211210222121023. The next prime is 211210222121113. The reversal of 211210222121112 is 211121222012112.
It is a super-2 number, since 2×2112102221211122 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (211210222121113) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 12246937 + ... + 23925047.
It is an arithmetic number, because the mean of its divisors is an integer number (16500821912640).
Almost surely, 2211210222121112 is an apocalyptic number.
It is an amenable number.
211210222121112 is an abundant number, since it is smaller than the sum of its proper divisors (316816079083368).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
211210222121112 is a wasteful number, since it uses less digits than its factorization.
211210222121112 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 12431703 (or 12431699 counting only the distinct ones).
The product of its (nonzero) digits is 128, while the sum is 21.
Adding to 211210222121112 its reverse (211121222012112), we get a palindrome (422331444133224).
The spelling of 211210222121112 in words is "two hundred eleven trillion, two hundred ten billion, two hundred twenty-two million, one hundred twenty-one thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •