Base | Representation |
---|---|
bin | 1001001100111011… |
… | …00010000100000000 |
3 | 110202021221100122101 |
4 | 10212131202010000 |
5 | 40104200240300 |
6 | 2134114320144 |
7 | 233265242254 |
oct | 44635420400 |
9 | 13667840571 |
10 | 4940243200 |
11 | 2105702922 |
12 | b5a589054 |
13 | 609668539 |
14 | 34c188264 |
15 | 1ddaa0b6a |
hex | 126762100 |
4940243200 has 108 divisors (see below), whose sum is σ = 12871762960. Its totient is φ = 1872046080.
The previous prime is 4940243167. The next prime is 4940243221. The reversal of 4940243200 is 23420494.
It is an unprimeable number.
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 11 ways as a sum of consecutive naturals, for example, 101287 + ... + 141913.
Almost surely, 24940243200 is an apocalyptic number.
4940243200 is a gapful number since it is divisible by the number (40) 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 4940243200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (6435881480).
4940243200 is an abundant number, since it is smaller than the sum of its proper divisors (7931519760).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4940243200 is a wasteful number, since it uses less digits than its factorization.
4940243200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 40672 (or 40653 counting only the distinct ones).
The product of its (nonzero) digits is 6912, while the sum is 28.
The square root of 4940243200 is about 70286.8636375248. The cubic root of 4940243200 is about 1703.1364473938.
Adding to 4940243200 its reverse (23420494), we get a palindrome (4963663694).
The spelling of 4940243200 in words is "four billion, nine hundred forty million, two hundred forty-three thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •