Base | Representation |
---|---|
bin | 10101110000110111111000 |
3 | 101201212002000 |
4 | 111300313320 |
5 | 2430031313 |
6 | 322141000 |
7 | 66331155 |
oct | 25606770 |
9 | 11655060 |
10 | 5705208 |
11 | 3247453 |
12 | 1ab1760 |
13 | 1249a82 |
14 | a8722c |
15 | 77a673 |
hex | 570df8 |
5705208 has 64 divisors (see below), whose sum is σ = 16144800. Its totient is φ = 1866240.
The previous prime is 5705201. The next prime is 5705213. The reversal of 5705208 is 8025075.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a zygodrome in base 7.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5705201) 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 15 ways as a sum of consecutive naturals, for example, 12960 + ... + 13392.
Almost surely, 25705208 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 5705208, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (8072400).
5705208 is an abundant number, since it is smaller than the sum of its proper divisors (10439592).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5705208 is a wasteful number, since it uses less digits than its factorization.
5705208 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 509 (or 499 counting only the distinct ones).
The product of its (nonzero) digits is 2800, while the sum is 27.
The square root of 5705208 is about 2388.5577238158. The cubic root of 5705208 is about 178.6859865002.
It can be divided in two parts, 570 and 5208, that added together give a triangular number (5778 = T107).
The spelling of 5705208 in words is "five million, seven hundred five thousand, two hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •