Base | Representation |
---|---|
bin | 10011101000110011010100 |
3 | 100200112112111 |
4 | 103220303110 |
5 | 2304212420 |
6 | 302200404 |
7 | 61520224 |
oct | 23506324 |
9 | 10615474 |
10 | 5147860 |
11 | 29a6733 |
12 | 1883104 |
13 | 10b3193 |
14 | 980084 |
15 | 6ba45a |
hex | 4e8cd4 |
5147860 has 72 divisors (see below), whose sum is σ = 12289536. Its totient is φ = 1805760.
The previous prime is 5147843. The next prime is 5147867. The reversal of 5147860 is 687415.
It is a Harshad number since it is a multiple of its sum of digits (31).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5147867) by changing a digit.
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 23 ways as a sum of consecutive naturals, for example, 166045 + ... + 166075.
It is an arithmetic number, because the mean of its divisors is an integer number (170688).
Almost surely, 25147860 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 5147860, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (6144768).
5147860 is an abundant number, since it is smaller than the sum of its proper divisors (7141676).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5147860 is a wasteful number, since it uses less digits than its factorization.
5147860 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 101 (or 80 counting only the distinct ones).
The product of its (nonzero) digits is 6720, while the sum is 31.
The square root of 5147860 is about 2268.8895962563. The cubic root of 5147860 is about 172.6668273346. Note that the first 3 decimals are identical.
The spelling of 5147860 in words is "five million, one hundred forty-seven thousand, eight hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •