Base | Representation |
---|---|
bin | 10101110000111011110100 |
3 | 101201212102100 |
4 | 111300323310 |
5 | 2430033320 |
6 | 322142100 |
7 | 66331665 |
oct | 25607364 |
9 | 11655370 |
10 | 5705460 |
11 | 3247662 |
12 | 1ab1930 |
13 | 1249c17 |
14 | a8736c |
15 | 77a790 |
hex | 570ef4 |
5705460 has 72 divisors (see below), whose sum is σ = 17919720. Its totient is φ = 1467648.
The previous prime is 5705423. The next prime is 5705467. The reversal of 5705460 is 645075.
It can be written as a sum of positive squares in 4 ways, for example, as 2178576 + 3526884 = 1476^2 + 1878^2 .
It is an Ulam number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5705467) by changing a digit.
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, 4674 + ... + 5766.
It is an arithmetic number, because the mean of its divisors is an integer number (248885).
Almost surely, 25705460 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 5705460, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (8959860).
5705460 is an abundant number, since it is smaller than the sum of its proper divisors (12214260).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5705460 is a wasteful number, since it uses less digits than its factorization.
5705460 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1137 (or 1132 counting only the distinct ones).
The product of its (nonzero) digits is 4200, while the sum is 27.
The square root of 5705460 is about 2388.6104747321. The cubic root of 5705460 is about 178.6886173249.
The spelling of 5705460 in words is "five million, seven hundred five thousand, four hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •