Base | Representation |
---|---|
bin | 1101001011001… |
… | …00101101101101 |
3 | 21200221122100021 |
4 | 12211210231231 |
5 | 211242404010 |
6 | 14544402141 |
7 | 2511226231 |
oct | 645445555 |
9 | 250848307 |
10 | 110513005 |
11 | 57422069 |
12 | 31016351 |
13 | 19b84a15 |
14 | 1096a5c1 |
15 | 9a7e8da |
hex | 6964b6d |
110513005 has 8 divisors (see below), whose sum is σ = 140416632. Its totient is φ = 83209728.
The previous prime is 110512993. The next prime is 110513009. The reversal of 110513005 is 500315011.
It can be written as a sum of positive squares in 4 ways, for example, as 14884164 + 95628841 = 3858^2 + 9779^2 .
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 110513005 - 213 = 110504813 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 110513005.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (110513009) 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, 649992 + ... + 650161.
It is an arithmetic number, because the mean of its divisors is an integer number (17552079).
Almost surely, 2110513005 is an apocalyptic number.
It is an amenable number.
110513005 is a deficient number, since it is larger than the sum of its proper divisors (29903627).
110513005 is a wasteful number, since it uses less digits than its factorization.
110513005 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1300175.
The product of its (nonzero) digits is 75, while the sum is 16.
The square root of 110513005 is about 10512.5165873829. The cubic root of 110513005 is about 479.8856860301.
Adding to 110513005 its reverse (500315011), we get a palindrome (610828016).
The spelling of 110513005 in words is "one hundred ten million, five hundred thirteen thousand, five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •