Base | Representation |
---|---|
bin | 1001101001010101… |
… | …1100010001100000 |
3 | 20200110020200110000 |
4 | 2122111130101200 |
5 | 20300330441341 |
6 | 1104533540000 |
7 | 121110534600 |
oct | 23225342140 |
9 | 6613220400 |
10 | 2589312096 |
11 | 1109665558 |
12 | 6031a4600 |
13 | 3235a0247 |
14 | 1a7c5cc00 |
15 | 1024bd8b6 |
hex | 9a55c460 |
2589312096 has 720 divisors, whose sum is σ = 9906850800. Its totient is φ = 658409472.
The previous prime is 2589312091. The next prime is 2589312139. The reversal of 2589312096 is 6902139852.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2589312091) 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 119 ways as a sum of consecutive naturals, for example, 69981390 + ... + 69981426.
It is an arithmetic number, because the mean of its divisors is an integer number (13759515).
Almost surely, 22589312096 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 2589312096, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (4953425400).
2589312096 is an abundant number, since it is smaller than the sum of its proper divisors (7317538704).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2589312096 is a wasteful number, since it uses less digits than its factorization.
2589312096 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 121 (or 97 counting only the distinct ones).
The product of its (nonzero) digits is 233280, while the sum is 45.
The square root of 2589312096 is about 50885.2836879190. The cubic root of 2589312096 is about 1373.1820993695.
The spelling of 2589312096 in words is "two billion, five hundred eighty-nine million, three hundred twelve thousand, ninety-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •