Base | Representation |
---|---|
bin | 1001101110101000… |
… | …1001001010001000 |
3 | 20202000000202112022 |
4 | 2123222021022020 |
5 | 20322022003130 |
6 | 1111045504012 |
7 | 121500343250 |
oct | 23352111210 |
9 | 6660022468 |
10 | 2611516040 |
11 | 1120150721 |
12 | 60a712008 |
13 | 328075883 |
14 | 1aab9c960 |
15 | 1044077e5 |
hex | 9ba89288 |
2611516040 has 64 divisors (see below), whose sum is σ = 6727190400. Its totient is φ = 893795328.
The previous prime is 2611516027. The next prime is 2611516093. The reversal of 2611516040 is 406151162.
It is an unprimeable number.
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 15 ways as a sum of consecutive naturals, for example, 156416 + ... + 172304.
It is an arithmetic number, because the mean of its divisors is an integer number (105112350).
Almost surely, 22611516040 is an apocalyptic number.
2611516040 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 2611516040, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (3363595200).
2611516040 is an abundant number, since it is smaller than the sum of its proper divisors (4115674360).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2611516040 is a wasteful number, since it uses less digits than its factorization.
2611516040 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16494 (or 16490 counting only the distinct ones).
The product of its (nonzero) digits is 1440, while the sum is 26.
The square root of 2611516040 is about 51102.9944328119. The cubic root of 2611516040 is about 1377.0960498799.
The spelling of 2611516040 in words is "two billion, six hundred eleven million, five hundred sixteen thousand, forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •