Base | Representation |
---|---|
bin | 1001101101001011… |
… | …1000000000010000 |
3 | 20201120112212111002 |
4 | 2123102320000100 |
5 | 20313441311324 |
6 | 1110311041132 |
7 | 121364450240 |
oct | 23322700020 |
9 | 6646485432 |
10 | 2605416464 |
11 | 1117764a52 |
12 | 6086701a8 |
13 | 326a1b461 |
14 | 1aa051b20 |
15 | 103b003ae |
hex | 9b4b8010 |
2605416464 has 80 divisors (see below), whose sum is σ = 6119251200. Its totient is φ = 1049075712.
The previous prime is 2605416461. The next prime is 2605416529. The reversal of 2605416464 is 4646145062.
It is not an unprimeable number, because it can be changed into a prime (2605416461) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1749032 + ... + 1750520.
It is an arithmetic number, because the mean of its divisors is an integer number (76490640).
Almost surely, 22605416464 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 2605416464, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (3059625600).
2605416464 is an abundant number, since it is smaller than the sum of its proper divisors (3513834736).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2605416464 is a wasteful number, since it uses less digits than its factorization.
2605416464 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2440 (or 2434 counting only the distinct ones).
The product of its (nonzero) digits is 138240, while the sum is 38.
The square root of 2605416464 is about 51043.2803021122. The cubic root of 2605416464 is about 1376.0230779661.
The spelling of 2605416464 in words is "two billion, six hundred five million, four hundred sixteen thousand, four hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.266 sec. • engine limits •