Base | Representation |
---|---|
bin | 10010100000101010010000 |
3 | 100010112012100 |
4 | 102200222100 |
5 | 2220233433 |
6 | 252000400 |
7 | 56146563 |
oct | 22405220 |
9 | 10115170 |
10 | 4852368 |
11 | 2814724 |
12 | 1760100 |
13 | 100b831 |
14 | 9044da |
15 | 65cb13 |
hex | 4a0a90 |
4852368 has 60 divisors (see below), whose sum is σ = 14030848. Its totient is φ = 1563840.
The previous prime is 4852363. The next prime is 4852381. The reversal of 4852368 is 8632584.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a d-powerful number, because it can be written as 48 + 8 + 55 + 2 + 314 + 63 + 83 .
It is not an unprimeable number, because it can be changed into a prime (4852363) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (7) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 3921 + ... + 5007.
Almost surely, 24852368 is an apocalyptic number.
4852368 is a gapful number since it is divisible by the number (48) 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 4852368, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (7015424).
4852368 is an abundant number, since it is smaller than the sum of its proper divisors (9178480).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4852368 is a wasteful number, since it uses less digits than its factorization.
4852368 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1132 (or 1123 counting only the distinct ones).
The product of its digits is 46080, while the sum is 36.
The square root of 4852368 is about 2202.8091156521. The cubic root of 4852368 is about 169.2977722391.
The spelling of 4852368 in words is "four million, eight hundred fifty-two thousand, three hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •