Base | Representation |
---|---|
bin | 1010110000110011… |
… | …1001100001100100 |
3 | 21110100021120200211 |
4 | 2230030321201210 |
5 | 21404100000000 |
6 | 1154402345204 |
7 | 131410424512 |
oct | 25414714144 |
9 | 7410246624 |
10 | 2889062500 |
11 | 1252889465 |
12 | 68765b204 |
13 | 37071154c |
14 | 1d59a94b2 |
15 | 11d97d7ba |
hex | ac339864 |
2889062500 has 81 divisors (see below), whose sum is σ = 6470211531. Its totient is φ = 1128750000.
The previous prime is 2889062471. The next prime is 2889062507. The reversal of 2889062500 is 52609882.
The square root of 2889062500 is 53750.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in 4 ways, for example, as 2054083684 + 834978816 = 45322^2 + 28896^2 .
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2889062507) by changing a digit.
It is a polite number, since it can be written in 26 ways as a sum of consecutive naturals, for example, 67187479 + ... + 67187521.
Almost surely, 22889062500 is an apocalyptic number.
2889062500 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
2889062500 is the 53750-th square number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 2889062500
2889062500 is an abundant number, since it is smaller than the sum of its proper divisors (3581149031).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2889062500 is an frugal number, since it uses more digits than its factorization.
2889062500 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 130 (or 50 counting only the distinct ones).
The product of its (nonzero) digits is 69120, while the sum is 40.
The cubic root of 2889062500 is about 1424.2480900338.
The spelling of 2889062500 in words is "two billion, eight hundred eighty-nine million, sixty-two thousand, five hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •