Base | Representation |
---|---|
bin | 10011011100010011011000 |
3 | 100120221022100 |
4 | 103130103120 |
5 | 2301043124 |
6 | 301123400 |
7 | 61215036 |
oct | 23342330 |
9 | 10527270 |
10 | 5096664 |
11 | 2971221 |
12 | 1859560 |
13 | 1095aa1 |
14 | 969556 |
15 | 6aa1c9 |
hex | 4dc4d8 |
5096664 has 48 divisors (see below), whose sum is σ = 14011920. Its totient is φ = 1673280.
The previous prime is 5096657. The next prime is 5096683. The reversal of 5096664 is 4666905.
It is a happy number.
5096664 is digitally balanced in base 5, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (36).
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 11 ways as a sum of consecutive naturals, for example, 4614 + ... + 5610.
It is an arithmetic number, because the mean of its divisors is an integer number (291915).
Almost surely, 25096664 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 5096664, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (7005960).
5096664 is an abundant number, since it is smaller than the sum of its proper divisors (8915256).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5096664 is a wasteful number, since it uses less digits than its factorization.
5096664 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1080 (or 1073 counting only the distinct ones).
The product of its (nonzero) digits is 38880, while the sum is 36.
The square root of 5096664 is about 2257.5792344899. The cubic root of 5096664 is about 172.0925227827.
The spelling of 5096664 in words is "five million, ninety-six thousand, six hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •