Base | Representation |
---|---|
bin | 10010111100101110111000 |
3 | 100100100221000 |
4 | 102330232320 |
5 | 2232423402 |
6 | 254245000 |
7 | 60136035 |
oct | 22745670 |
9 | 10310830 |
10 | 4967352 |
11 | 2893055 |
12 | 17b6760 |
13 | 104bc80 |
14 | 93438c |
15 | 681c1c |
hex | 4bcbb8 |
4967352 has 128 divisors (see below), whose sum is σ = 15624000. Its totient is φ = 1451520.
The previous prime is 4967329. The next prime is 4967353. The reversal of 4967352 is 2537694.
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 + 93 + 63 + 76 + 314 + 53 + 27 .
Its product of digits (45360) is a multiple of the sum of its prime divisors (108).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4967353) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 81402 + ... + 81462.
Almost surely, 24967352 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 4967352, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (7812000).
4967352 is an abundant number, since it is smaller than the sum of its proper divisors (10656648).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4967352 is a wasteful number, since it uses less digits than its factorization.
4967352 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 118 (or 108 counting only the distinct ones).
The product of its digits is 45360, while the sum is 36.
The square root of 4967352 is about 2228.7557066668. The cubic root of 4967352 is about 170.6245996851.
The spelling of 4967352 in words is "four million, nine hundred sixty-seven thousand, three hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.096 sec. • engine limits •