Base | Representation |
---|---|
bin | 10101101100101100001000 |
3 | 101200222120100 |
4 | 111230230020 |
5 | 2424004242 |
6 | 321525400 |
7 | 66230205 |
oct | 25545410 |
9 | 11628510 |
10 | 5688072 |
11 | 3235595 |
12 | 1aa3860 |
13 | 1242030 |
14 | a80cac |
15 | 77554c |
hex | 56cb08 |
5688072 has 96 divisors (see below), whose sum is σ = 17035200. Its totient is φ = 1703808.
The previous prime is 5688071. The next prime is 5688077. The reversal of 5688072 is 2708865.
5688072 is nontrivially palindromic in base 5.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5688071) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 55173 + ... + 55275.
It is an arithmetic number, because the mean of its divisors is an integer number (177450).
Almost surely, 25688072 is an apocalyptic number.
5688072 is a gapful number since it is divisible by the number (52) 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 5688072, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (8517600).
5688072 is an abundant number, since it is smaller than the sum of its proper divisors (11347128).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5688072 is a wasteful number, since it uses less digits than its factorization.
5688072 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 187 (or 180 counting only the distinct ones).
The product of its (nonzero) digits is 26880, while the sum is 36.
The square root of 5688072 is about 2384.9679243126. The cubic root of 5688072 is about 178.5069083784.
The spelling of 5688072 in words is "five million, six hundred eighty-eight thousand, seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •