Base | Representation |
---|---|
bin | 101111111111111011001001… |
… | …010100001001110111100000 |
3 | 1000200110001122001102122011020 |
4 | 233333323021110021313200 |
5 | 210132134342121231422 |
6 | 2024550245252245440 |
7 | 62315355033303240 |
oct | 5777731124116740 |
9 | 1020401561378136 |
10 | 211101020102112 |
11 | 61299492501158 |
12 | 1b814960610880 |
13 | 90a398264a58a |
14 | 3a1b4b58bbb20 |
15 | 196134e2d595c |
hex | bffec9509de0 |
211101020102112 has 96 divisors (see below), whose sum is σ = 633305618265600. Its totient is φ = 60314333557248.
The previous prime is 211101020101987. The next prime is 211101020102143. The reversal of 211101020102112 is 211201020101112.
It is a happy number.
It is a tau number, because it is divible by the number of its divisors (96).
It is a junction number, because it is equal to n+sod(n) for n = 211101020102091 and 211101020102100.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 226125189 + ... + 227056827.
It is an arithmetic number, because the mean of its divisors is an integer number (6596933523600).
Almost surely, 2211101020102112 is an apocalyptic number.
It is an amenable number.
211101020102112 is an abundant number, since it is smaller than the sum of its proper divisors (422204598163488).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
211101020102112 is a wasteful number, since it uses less digits than its factorization.
211101020102112 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1268848 (or 1268840 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 211101020102112 its reverse (211201020101112), we get a palindrome (422302040203224).
The spelling of 211101020102112 in words is "two hundred eleven trillion, one hundred one billion, twenty million, one hundred two thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •