Base | Representation |
---|---|
bin | 1100010010011111001… |
… | …1001010011101011001 |
3 | 202011221101122011122222 |
4 | 3010213303022131121 |
5 | 11424334001333423 |
6 | 240553202153425 |
7 | 21152530630430 |
oct | 3044763123531 |
9 | 664841564588 |
10 | 211121121113 |
11 | 81599407091 |
12 | 34b00052875 |
13 | 16ba7373b06 |
14 | a30b0c0117 |
15 | 575998b3c8 |
hex | 3127cca759 |
211121121113 has 8 divisors (see below), whose sum is σ = 241286784960. Its totient is φ = 180956833200.
The previous prime is 211121121011. The next prime is 211121121161. The reversal of 211121121113 is 311121121112.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 211121121113 - 28 = 211121120857 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 211121121091 and 211121121100.
It is not an unprimeable number, because it can be changed into a prime (211121121173) 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, 8963 + ... + 649863.
It is an arithmetic number, because the mean of its divisors is an integer number (30160848120).
Almost surely, 2211121121113 is an apocalyptic number.
It is an amenable number.
211121121113 is a deficient number, since it is larger than the sum of its proper divisors (30165663847).
211121121113 is an equidigital number, since it uses as much as digits as its factorization.
211121121113 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 687967.
The product of its digits is 24, while the sum is 17.
Adding to 211121121113 its reverse (311121121112), we get a palindrome (522242242225).
Subtracting 211121121113 from its reverse (311121121112), we obtain a palindrome (99999999999).
The spelling of 211121121113 in words is "two hundred eleven billion, one hundred twenty-one million, one hundred twenty-one thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •