Base | Representation |
---|---|
bin | 110000000000000011101101… |
… | …001100111011001000101100 |
3 | 1000200110221100122211120202010 |
4 | 300000003231030323020230 |
5 | 210132312203300334012 |
6 | 2024554405333201220 |
7 | 62316131600211432 |
oct | 6000035514731054 |
9 | 1020427318746663 |
10 | 211110212121132 |
11 | 612a237a124095 |
12 | 1b8166a6a90210 |
13 | 90a47b8b1c29c |
14 | 3a1bb085d8d52 |
15 | 19616db291c3c |
hex | c000ed33b22c |
211110212121132 has 24 divisors (see below), whose sum is σ = 492591632151472. Its totient is φ = 70369908249600.
The previous prime is 211110212121103. The next prime is 211110212121167. The reversal of 211110212121132 is 231121212011112.
It is a super-2 number, since 2×2111102121211322 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 211110212121099 and 211110212121108.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 14833669 + ... + 25342812.
Almost surely, 2211110212121132 is an apocalyptic number.
It is an amenable number.
211110212121132 is an abundant number, since it is smaller than the sum of its proper divisors (281481420030340).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
211110212121132 is a wasteful number, since it uses less digits than its factorization.
211110212121132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 40614369 (or 40614367 counting only the distinct ones).
The product of its (nonzero) digits is 96, while the sum is 21.
Adding to 211110212121132 its reverse (231121212011112), we get a palindrome (442231424132244).
The spelling of 211110212121132 in words is "two hundred eleven trillion, one hundred ten billion, two hundred twelve million, one hundred twenty-one thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •