Base | Representation |
---|---|
bin | 10010000110100110101000 |
3 | 22221002210110 |
4 | 102012212220 |
5 | 2203330030 |
6 | 245414320 |
7 | 55223454 |
oct | 22064650 |
9 | 8832713 |
10 | 4745640 |
11 | 2751519 |
12 | 170a3a0 |
13 | ca2093 |
14 | 8b7664 |
15 | 63b1b0 |
hex | 4869a8 |
4745640 has 64 divisors (see below), whose sum is σ = 14463360. Its totient is φ = 1245440.
The previous prime is 4745623. The next prime is 4745641. The reversal of 4745640 is 465474.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a junction number, because it is equal to n+sod(n) for n = 4745598 and 4745607.
It is not an unprimeable number, because it can be changed into a prime (4745641) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 8242 + ... + 8798.
It is an arithmetic number, because the mean of its divisors is an integer number (225990).
Almost surely, 24745640 is an apocalyptic number.
4745640 is a gapful number since it is divisible by the number (40) 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 4745640, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (7231680).
4745640 is an abundant number, since it is smaller than the sum of its proper divisors (9717720).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4745640 is a wasteful number, since it uses less digits than its factorization.
4745640 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 642 (or 638 counting only the distinct ones).
The product of its (nonzero) digits is 13440, while the sum is 30.
The square root of 4745640 is about 2178.4489895336. The cubic root of 4745640 is about 168.0473222699.
The spelling of 4745640 in words is "four million, seven hundred forty-five thousand, six hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •