Base | Representation |
---|---|
bin | 11001001010110… |
… | …01011100000001 |
3 | 112201021112001211 |
4 | 30211121130001 |
5 | 413022130423 |
6 | 32541130121 |
7 | 5142401455 |
oct | 1445313401 |
9 | 481245054 |
10 | 211130113 |
11 | a91a51a7 |
12 | 5a859941 |
13 | 3498337c |
14 | 2007c665 |
15 | 1380710d |
hex | c959701 |
211130113 has 4 divisors (see below), whose sum is σ = 211190320. Its totient is φ = 211069908.
The previous prime is 211130093. The next prime is 211130131. The reversal of 211130113 is 311031112.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-211130113 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 211130093 and 211130102.
It is not an unprimeable number, because it can be changed into a prime (211130173) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 24495 + ... + 31972.
It is an arithmetic number, because the mean of its divisors is an integer number (52797580).
Almost surely, 2211130113 is an apocalyptic number.
It is an amenable number.
211130113 is a deficient number, since it is larger than the sum of its proper divisors (60207).
211130113 is an equidigital number, since it uses as much as digits as its factorization.
211130113 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 60206.
The product of its (nonzero) digits is 18, while the sum is 13.
The square root of 211130113 is about 14530.3170302647. The cubic root of 211130113 is about 595.4565269691.
Adding to 211130113 its reverse (311031112), we get a palindrome (522161225).
Subtracting 211130113 from its reverse (311031112), we obtain a palindrome (99900999).
The spelling of 211130113 in words is "two hundred eleven million, one hundred thirty thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •