Base | Representation |
---|---|
bin | 111110111001000… |
… | …1010010011100101 |
3 | 12110001220102022121 |
4 | 1331302022103211 |
5 | 13310214121123 |
6 | 545223025541 |
7 | 103203160153 |
oct | 17562122345 |
9 | 5401812277 |
10 | 2110301413 |
11 | 993234760 |
12 | 4aa89b2b1 |
13 | 27828697c |
14 | 1603ac3d3 |
15 | c53ee75d |
hex | 7dc8a4e5 |
2110301413 has 4 divisors (see below), whose sum is σ = 2302147008. Its totient is φ = 1918455820.
The previous prime is 2110301383. The next prime is 2110301419. The reversal of 2110301413 is 3141030112.
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 2110301413 - 213 = 2110293221 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2110301419) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 95922781 + ... + 95922802.
It is an arithmetic number, because the mean of its divisors is an integer number (575536752).
Almost surely, 22110301413 is an apocalyptic number.
It is an amenable number.
2110301413 is a deficient number, since it is larger than the sum of its proper divisors (191845595).
2110301413 is a wasteful number, since it uses less digits than its factorization.
2110301413 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 191845594.
The product of its (nonzero) digits is 72, while the sum is 16.
The square root of 2110301413 is about 45938.0170773620. The cubic root of 2110301413 is about 1282.6696829220.
Adding to 2110301413 its reverse (3141030112), we get a palindrome (5251331525).
The spelling of 2110301413 in words is "two billion, one hundred ten million, three hundred one thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •