Base | Representation |
---|---|
bin | 111011111001010… |
… | …0000011110000100 |
3 | 12012001122210202201 |
4 | 1313302200132010 |
5 | 13103442311100 |
6 | 531231244244 |
7 | 100542261634 |
oct | 16762403604 |
9 | 5161583681 |
10 | 2009728900 |
11 | 941492083 |
12 | 481079684 |
13 | 2604a26ca |
14 | 150cac6c4 |
15 | bb68536a |
hex | 77ca0784 |
2009728900 has 27 divisors (see below), whose sum is σ = 4362084741. Its totient is φ = 803712240.
The previous prime is 2009728841. The next prime is 2009728907. The reversal of 2009728900 is 98279002.
The square root of 2009728900 is 44830.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in only one way, i.e., 723502404 + 1286226496 = 26898^2 + 35864^2 .
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 2009728900.
It is not an unprimeable number, because it can be changed into a prime (2009728907) by changing a digit.
It is a polite number, since it can be written in 8 ways as a sum of consecutive naturals, for example, 446059 + ... + 450541.
Almost surely, 22009728900 is an apocalyptic number.
2009728900 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
2009728900 is the 44830-th square number.
It is an amenable number.
2009728900 is an abundant number, since it is smaller than the sum of its proper divisors (2352355841).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2009728900 is an frugal number, since it uses more digits than its factorization.
2009728900 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8980 (or 4490 counting only the distinct ones).
The product of its (nonzero) digits is 18144, while the sum is 37.
The cubic root of 2009728900 is about 1261.9606872071.
The spelling of 2009728900 in words is "two billion, nine million, seven hundred twenty-eight thousand, nine hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •