Base | Representation |
---|---|
bin | 10011000011010000100000 |
3 | 100101201120221 |
4 | 103003100200 |
5 | 2234302310 |
6 | 255012424 |
7 | 60310000 |
oct | 23032040 |
9 | 10351527 |
10 | 4994080 |
11 | 2901143 |
12 | 180a114 |
13 | 105b1a0 |
14 | 940000 |
15 | 689ada |
hex | 4c3420 |
4994080 has 120 divisors (see below), whose sum is σ = 14822892. Its totient is φ = 1580544.
The previous prime is 4994051. The next prime is 4994081. The reversal of 4994080 is 804994.
It can be written as a sum of positive squares in 2 ways, for example, as 4648336 + 345744 = 2156^2 + 588^2 .
It is a nialpdrome in base 14.
It is not an unprimeable number, because it can be changed into a prime (4994081) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (7) of ones.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 384154 + ... + 384166.
Almost surely, 24994080 is an apocalyptic number.
4994080 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 4994080, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (7411446).
4994080 is an abundant number, since it is smaller than the sum of its proper divisors (9828812).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4994080 is an equidigital number, since it uses as much as digits as its factorization.
4994080 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 56 (or 27 counting only the distinct ones).
The product of its (nonzero) digits is 10368, while the sum is 34.
The square root of 4994080 is about 2234.7438331943. The cubic root of 4994080 is about 170.9300809646.
The spelling of 4994080 in words is "four million, nine hundred ninety-four thousand, eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •