Base | Representation |
---|---|
bin | 1001101110100111… |
… | …1011000000000000 |
3 | 20201222220210222110 |
4 | 2123221323000000 |
5 | 20322013124143 |
6 | 1111044335320 |
7 | 121500012213 |
oct | 23351730000 |
9 | 6658823873 |
10 | 2611458048 |
11 | 11201110a1 |
12 | 60a6a4540 |
13 | 328055364 |
14 | 1aab8577a |
15 | 1043e5533 |
hex | 9ba7b000 |
2611458048 has 78 divisors (see below), whose sum is σ = 6978175012. Its totient is φ = 868597760.
The previous prime is 2611458041. The next prime is 2611458067. The reversal of 2611458048 is 8408541162.
It is a junction number, because it is equal to n+sod(n) for n = 2611457997 and 2611458015.
It is not an unprimeable number, because it can be changed into a prime (2611458041) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 5664538 + ... + 5664998.
Almost surely, 22611458048 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 2611458048, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (3489087506).
2611458048 is an abundant number, since it is smaller than the sum of its proper divisors (4366716964).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2611458048 is an frugal number, since it uses more digits than its factorization.
2611458048 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 949 (or 466 counting only the distinct ones).
The product of its (nonzero) digits is 61440, while the sum is 39.
The square root of 2611458048 is about 51102.4270265122. The cubic root of 2611458048 is about 1377.0858564209.
The spelling of 2611458048 in words is "two billion, six hundred eleven million, four hundred fifty-eight thousand, forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •