Base | Representation |
---|---|
bin | 1001101101000000… |
… | …0000001010010000 |
3 | 20201112010121112022 |
4 | 2123100000022100 |
5 | 20313243212230 |
6 | 1110242551012 |
7 | 121355162651 |
oct | 23320001220 |
9 | 6645117468 |
10 | 2604663440 |
11 | 11172a0215 |
12 | 608368468 |
13 | 326816792 |
14 | 1a9cd7528 |
15 | 103a021e5 |
hex | 9b400290 |
2604663440 has 40 divisors (see below), whose sum is σ = 6059846520. Its totient is φ = 1041176576.
The previous prime is 2604663427. The next prime is 2604663463. The reversal of 2604663440 is 443664062.
It can be written as a sum of positive squares in 4 ways, for example, as 210714256 + 2393949184 = 14516^2 + 48928^2 .
It is a tau number, because it is divible by the number of its divisors (40).
It is a self number, because there is not a number n which added to its sum of digits gives 2604663440.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 121016 + ... + 140904.
It is an arithmetic number, because the mean of its divisors is an integer number (151496163).
Almost surely, 22604663440 is an apocalyptic number.
2604663440 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
2604663440 is an abundant number, since it is smaller than the sum of its proper divisors (3455183080).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2604663440 is a wasteful number, since it uses less digits than its factorization.
2604663440 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21539 (or 21533 counting only the distinct ones).
The product of its (nonzero) digits is 82944, while the sum is 35.
The square root of 2604663440 is about 51035.9034406172. The cubic root of 2604663440 is about 1375.8904979789.
The spelling of 2604663440 in words is "two billion, six hundred four million, six hundred sixty-three thousand, four hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •