Base | Representation |
---|---|
bin | 10010011001101101011000 |
3 | 100002002010211 |
4 | 102121231120 |
5 | 2213331041 |
6 | 251220504 |
7 | 56000560 |
oct | 22315530 |
9 | 10062124 |
10 | 4823896 |
11 | 27a52a0 |
12 | 1747734 |
13 | ccb89c |
14 | 8d7da0 |
15 | 654481 |
hex | 499b58 |
4823896 has 64 divisors (see below), whose sum is σ = 11612160. Its totient is φ = 1824000.
The previous prime is 4823887. The next prime is 4823909. The reversal of 4823896 is 6983284.
It is a d-powerful number, because it can be written as 4 + 8 + 27 + 35 + 85 + 97 + 65 .
4823896 is a Rhonda number in base 15.
Its product of digits (82944) is a multiple of the sum of its prime factors (256).
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 15 ways as a sum of consecutive naturals, for example, 25161 + ... + 25351.
It is an arithmetic number, because the mean of its divisors is an integer number (181440).
Almost surely, 24823896 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 4823896, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (5806080).
4823896 is an abundant number, since it is smaller than the sum of its proper divisors (6788264).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4823896 is a wasteful number, since it uses less digits than its factorization.
4823896 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 256 (or 252 counting only the distinct ones).
The product of its digits is 82944, while the sum is 40.
The square root of 4823896 is about 2196.3369504700. The cubic root of 4823896 is about 168.9659957495.
The spelling of 4823896 in words is "four million, eight hundred twenty-three thousand, eight hundred ninety-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.101 sec. • engine limits •