Base | Representation |
---|---|
bin | 110000000000001101110110… |
… | …001110110001111111000000 |
3 | 1000200111222110112020000102021 |
4 | 300000031312032301333000 |
5 | 210133002003330133440 |
6 | 2025003410032131224 |
7 | 62316665460301513 |
oct | 6000156616617700 |
9 | 1020458415200367 |
10 | 211121101021120 |
11 | 612a6a57679894 |
12 | 1b818825696b14 |
13 | 90a5832a17984 |
14 | 3a1c45c828d7a |
15 | 1961b271d784a |
hex | c003763b1fc0 |
211121101021120 has 112 divisors (see below), whose sum is σ = 532311477928128. Its totient is φ = 79479858053120.
The previous prime is 211121101021109. The next prime is 211121101021133. The reversal of 211121101021120 is 21120101121112.
It is a Harshad number since it is a multiple of its sum of digits (16).
It is a junction number, because it is equal to n+sod(n) for n = 211121101021094 and 211121101021103.
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, 519975309 + ... + 520381171.
Almost surely, 2211121101021120 is an apocalyptic number.
211121101021120 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
211121101021120 is an abundant number, since it is smaller than the sum of its proper divisors (321190376907008).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
211121101021120 is a wasteful number, since it uses less digits than its factorization.
211121101021120 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 501518 (or 501508 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 16.
Adding to 211121101021120 its reverse (21120101121112), we get a palindrome (232241202142232).
The spelling of 211121101021120 in words is "two hundred eleven trillion, one hundred twenty-one billion, one hundred one million, twenty-one thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •