Base | Representation |
---|---|
bin | 110000000000001001101110… |
… | …001110001000011111000000 |
3 | 1000200111120000211121110121210 |
4 | 300000021232032020133000 |
5 | 210132413420421303422 |
6 | 2025001354323450120 |
7 | 62316450634352202 |
oct | 6000115616103700 |
9 | 1020446024543553 |
10 | 211116671666112 |
11 | 612a509439a913 |
12 | 1b8179aa226940 |
13 | 90a52a8177454 |
14 | 3a1c15c46c772 |
15 | 196196840110c |
hex | c0026e3887c0 |
211116671666112 has 112 divisors (see below), whose sum is σ = 575634216259872. Its totient is φ = 68236584284160.
The previous prime is 211116671666111. The next prime is 211116671666123. The reversal of 211116671666112 is 211666176611112.
It is a Harshad number since it is a multiple of its sum of digits (48).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (211116671666111) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 48631839 + ... + 52794782.
It is an arithmetic number, because the mean of its divisors is an integer number (5139591216606).
Almost surely, 2211116671666112 is an apocalyptic number.
It is an amenable number.
211116671666112 is an abundant number, since it is smaller than the sum of its proper divisors (364517544593760).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
211116671666112 is a wasteful number, since it uses less digits than its factorization.
211116671666112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 101426966 (or 101426956 counting only the distinct ones).
The product of its digits is 217728, while the sum is 48.
The spelling of 211116671666112 in words is "two hundred eleven trillion, one hundred sixteen billion, six hundred seventy-one million, six hundred sixty-six thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •