Base | Representation |
---|---|
bin | 1010110010100101… |
… | …0001101000000000 |
3 | 21110212021111202000 |
4 | 2230221101220000 |
5 | 21413001014443 |
6 | 1155230024000 |
7 | 131530566024 |
oct | 25451215000 |
9 | 7425244660 |
10 | 2896501248 |
11 | 1256aaa293 |
12 | 68a048000 |
13 | 372117384 |
14 | 1d6984384 |
15 | 11e44c8d3 |
hex | aca51a00 |
2896501248 has 160 divisors (see below), whose sum is σ = 8626590720. Its totient is φ = 959569920.
The previous prime is 2896501243. The next prime is 2896501249. The reversal of 2896501248 is 8421056982.
It is not an unprimeable number, because it can be changed into a prime (2896501243) 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, 2639836 + ... + 2640932.
It is an arithmetic number, because the mean of its divisors is an integer number (53916192).
Almost surely, 22896501248 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 2896501248, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (4313295360).
2896501248 is an abundant number, since it is smaller than the sum of its proper divisors (5730089472).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2896501248 is a wasteful number, since it uses less digits than its factorization.
2896501248 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1315 (or 1293 counting only the distinct ones).
The product of its (nonzero) digits is 276480, while the sum is 45.
The square root of 2896501248 is about 53819.1531705953. The cubic root of 2896501248 is about 1425.4694253997.
The spelling of 2896501248 in words is "two billion, eight hundred ninety-six million, five hundred one thousand, two hundred forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •