Base | Representation |
---|---|
bin | 111110111000100… |
… | …0101111101001101 |
3 | 12110001101012021201 |
4 | 1331301011331031 |
5 | 13310131141303 |
6 | 545213025501 |
7 | 103200613021 |
oct | 17561057515 |
9 | 5401335251 |
10 | 2110021453 |
11 | 993063391 |
12 | 4aa785291 |
13 | 2781b9407 |
14 | 160338381 |
15 | c539681d |
hex | 7dc45f4d |
2110021453 has 16 divisors (see below), whose sum is σ = 2253968640. Its totient is φ = 1968350976.
The previous prime is 2110021393. The next prime is 2110021457. The reversal of 2110021453 is 3541200112.
It is a cyclic number.
It is not a de Polignac number, because 2110021453 - 229 = 1573150541 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 2110021453.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2110021457) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1245475 + ... + 1247167.
It is an arithmetic number, because the mean of its divisors is an integer number (140873040).
Almost surely, 22110021453 is an apocalyptic number.
It is an amenable number.
2110021453 is a deficient number, since it is larger than the sum of its proper divisors (143947187).
2110021453 is a wasteful number, since it uses less digits than its factorization.
2110021453 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2316.
The product of its (nonzero) digits is 240, while the sum is 19.
The square root of 2110021453 is about 45934.9698269194. The cubic root of 2110021453 is about 1282.6129592579.
Adding to 2110021453 its reverse (3541200112), we get a palindrome (5651221565).
The spelling of 2110021453 in words is "two billion, one hundred ten million, twenty-one thousand, four hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •