Base | Representation |
---|---|
bin | 1001101101011001… |
… | …1100011110000000 |
3 | 20201122022102011001 |
4 | 2123112130132000 |
5 | 20314211233011 |
6 | 1110343101344 |
7 | 121405425424 |
oct | 23326343600 |
9 | 6648272131 |
10 | 2606352256 |
11 | 1118244032 |
12 | 608a41854 |
13 | 326c88391 |
14 | 1aa216b84 |
15 | 103c377c1 |
hex | 9b59c780 |
2606352256 has 64 divisors (see below), whose sum is σ = 5250274560. Its totient is φ = 1288742400.
The previous prime is 2606352211. The next prime is 2606352257. The reversal of 2606352256 is 6522536062.
It is a tau number, because it is divible by the number of its divisors (64).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2606352257) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 7874011 + ... + 7874341.
It is an arithmetic number, because the mean of its divisors is an integer number (82035540).
Almost surely, 22606352256 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 2606352256, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2625137280).
2606352256 is an abundant number, since it is smaller than the sum of its proper divisors (2643922304).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2606352256 is a wasteful number, since it uses less digits than its factorization.
2606352256 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 843 (or 831 counting only the distinct ones).
The product of its (nonzero) digits is 129600, while the sum is 37.
The square root of 2606352256 is about 51052.4461314049. The cubic root of 2606352256 is about 1376.1878011203.
The spelling of 2606352256 in words is "two billion, six hundred six million, three hundred fifty-two thousand, two hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •