Base | Representation |
---|---|
bin | 111111011111000… |
… | …0111000100101001 |
3 | 12111110100221021220 |
4 | 1332332013010221 |
5 | 13330313223423 |
6 | 551213452253 |
7 | 103534332012 |
oct | 17676070451 |
9 | 5443327256 |
10 | 2130211113 |
11 | 9a34a3158 |
12 | 4b54a1089 |
13 | 27c437c64 |
14 | 162cb2009 |
15 | c70339e3 |
hex | 7ef87129 |
2130211113 has 4 divisors (see below), whose sum is σ = 2840281488. Its totient is φ = 1420140740.
The previous prime is 2130211103. The next prime is 2130211117. The reversal of 2130211113 is 3111120312.
It is a happy number.
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 not a de Polignac number, because 2130211113 - 25 = 2130211081 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2130211092 and 2130211101.
It is not an unprimeable number, because it can be changed into a prime (2130211117) 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, 355035183 + ... + 355035188.
It is an arithmetic number, because the mean of its divisors is an integer number (710070372).
Almost surely, 22130211113 is an apocalyptic number.
It is an amenable number.
2130211113 is a deficient number, since it is larger than the sum of its proper divisors (710070375).
2130211113 is an equidigital number, since it uses as much as digits as its factorization.
2130211113 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 710070374.
The product of its (nonzero) digits is 36, while the sum is 15.
The square root of 2130211113 is about 46154.2101329879. The cubic root of 2130211113 is about 1286.6908581439.
Adding to 2130211113 its reverse (3111120312), we get a palindrome (5241331425).
The spelling of 2130211113 in words is "two billion, one hundred thirty million, two hundred eleven thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.099 sec. • engine limits •