Base | Representation |
---|---|
bin | 1111011110100011000000 |
3 | 21122010112122 |
4 | 33132203000 |
5 | 2014313110 |
6 | 222543412 |
7 | 46325543 |
oct | 17364300 |
9 | 7563478 |
10 | 4057280 |
11 | 2321327 |
12 | 1437b68 |
13 | ac0976 |
14 | 77885a |
15 | 552255 |
hex | 3de8c0 |
4057280 has 56 divisors (see below), whose sum is σ = 9997440. Its totient is φ = 1566720.
The previous prime is 4057247. The next prime is 4057297. The reversal of 4057280 is 827504.
4057280 is nontrivially palindromic in base 15.
4057280 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an Ulam number.
It is a zygodrome in base 15.
It is a congruent number.
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 7 ways as a sum of consecutive naturals, for example, 9716 + ... + 10124.
Almost surely, 24057280 is an apocalyptic number.
4057280 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 4057280, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (4998720).
4057280 is an abundant number, since it is smaller than the sum of its proper divisors (5940160).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4057280 is a wasteful number, since it uses less digits than its factorization.
4057280 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 457 (or 447 counting only the distinct ones).
The product of its (nonzero) digits is 2240, while the sum is 26.
The square root of 4057280 is about 2014.2690982091. The cubic root of 4057280 is about 159.4942362870.
The spelling of 4057280 in words is "four million, fifty-seven thousand, two hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •