Base | Representation |
---|---|
bin | 1000100101010100… |
… | …0110101111000000 |
3 | 12221120101220012011 |
4 | 2021111012233000 |
5 | 14204311324300 |
6 | 1020342542304 |
7 | 111044525551 |
oct | 21125065700 |
9 | 5846356164 |
10 | 2304011200 |
11 | a82610797 |
12 | 543737994 |
13 | 2a944ab4a |
14 | 17bdd4328 |
15 | d7414eba |
hex | 89546bc0 |
2304011200 has 168 divisors, whose sum is σ = 5972019552. Its totient is φ = 873185280.
The previous prime is 2304011197. The next prime is 2304011219. The reversal of 2304011200 is 21104032.
It is a congruent number.
It is an unprimeable number.
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 23 ways as a sum of consecutive naturals, for example, 5041372 + ... + 5041828.
Almost surely, 22304011200 is an apocalyptic number.
2304011200 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 2304011200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2986009776).
2304011200 is an abundant number, since it is smaller than the sum of its proper divisors (3668008352).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2304011200 is a wasteful number, since it uses less digits than its factorization.
2304011200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 639 (or 624 counting only the distinct ones).
The product of its (nonzero) digits is 48, while the sum is 13.
The square root of 2304011200 is about 48000.1166665249. The cubic root of 2304011200 is about 1320.7730396924.
Adding to 2304011200 its reverse (21104032), we get a palindrome (2325115232).
The spelling of 2304011200 in words is "two billion, three hundred four million, eleven thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.024 sec. • engine limits •