Base | Representation |
---|---|
bin | 1000010110001100… |
… | …1111010101110101 |
3 | 12210011002122210212 |
4 | 2011203033111311 |
5 | 14042043420410 |
6 | 1010155555205 |
7 | 106344564455 |
oct | 20543172565 |
9 | 5704078725 |
10 | 2240607605 |
11 | a4a845725 |
12 | 52645bb05 |
13 | 29927b922 |
14 | 17380bd65 |
15 | d1a8db05 |
hex | 858cf575 |
2240607605 has 8 divisors (see below), whose sum is σ = 2691067992. Its totient is φ = 1790926848.
The previous prime is 2240607601. The next prime is 2240607697. The reversal of 2240607605 is 5067060422.
It can be written as a sum of positive squares in 4 ways, for example, as 357134404 + 1883473201 = 18898^2 + 43399^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 2240607605 - 22 = 2240607601 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 (2240607601) 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 7 ways as a sum of consecutive naturals, for example, 188564 + ... + 200093.
It is an arithmetic number, because the mean of its divisors is an integer number (336383499).
Almost surely, 22240607605 is an apocalyptic number.
It is an amenable number.
2240607605 is a deficient number, since it is larger than the sum of its proper divisors (450460387).
2240607605 is a wasteful number, since it uses less digits than its factorization.
2240607605 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 389815.
The product of its (nonzero) digits is 20160, while the sum is 32.
The square root of 2240607605 is about 47335.0568289508. The cubic root of 2240607605 is about 1308.5448179187.
The spelling of 2240607605 in words is "two billion, two hundred forty million, six hundred seven thousand, six hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •