Base | Representation |
---|---|
bin | 110000000000001101111100… |
… | …101110111000110100010011 |
3 | 1000200111222202010110211220020 |
4 | 300000031330232320310103 |
5 | 210133002214241213021 |
6 | 2025003424530114523 |
7 | 62320001253411630 |
oct | 6000157456706423 |
9 | 1020458663424806 |
10 | 211121210101011 |
11 | 612a7003202161 |
12 | 1b81885611ba43 |
13 | 90a584c4ba2a2 |
14 | 3a1c46d101187 |
15 | 1961b31a827c6 |
hex | c0037cbb8d13 |
211121210101011 has 8 divisors (see below), whose sum is σ = 321708510630144. Its totient is φ = 120640691486280.
The previous prime is 211121210100971. The next prime is 211121210101069. The reversal of 211121210101011 is 110101012121112.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 211121210101011 - 29 = 211121210100499 is a prime.
It is not an unprimeable number, because it can be changed into a prime (211121210101211) 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, 5026695478575 + ... + 5026695478616.
It is an arithmetic number, because the mean of its divisors is an integer number (40213563828768).
Almost surely, 2211121210101011 is an apocalyptic number.
211121210101011 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
211121210101011 is a deficient number, since it is larger than the sum of its proper divisors (110587300529133).
211121210101011 is a wasteful number, since it uses less digits than its factorization.
211121210101011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10053390957201.
The product of its (nonzero) digits is 8, while the sum is 15.
Adding to 211121210101011 its reverse (110101012121112), we get a palindrome (321222222222123).
The spelling of 211121210101011 in words is "two hundred eleven trillion, one hundred twenty-one billion, two hundred ten million, one hundred one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.097 sec. • engine limits •