Base | Representation |
---|---|
bin | 10010001000001010000000 |
3 | 22221102112000 |
4 | 102020022000 |
5 | 2204031000 |
6 | 245504000 |
7 | 55251141 |
oct | 22101200 |
9 | 8842460 |
10 | 4752000 |
11 | 2756280 |
12 | 1712000 |
13 | ca4c46 |
14 | 8b9ac8 |
15 | 63d000 |
hex | 488280 |
4752000 has 256 divisors, whose sum is σ = 19094400. Its totient is φ = 1152000.
The previous prime is 4751951. The next prime is 4752001. The reversal of 4752000 is 2574.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4752001) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (5) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 431995 + ... + 432005.
Almost surely, 24752000 is an apocalyptic number.
4752000 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 4752000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (9547200).
4752000 is an abundant number, since it is smaller than the sum of its proper divisors (14342400).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4752000 is a wasteful number, since it uses less digits than its factorization.
4752000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 49 (or 21 counting only the distinct ones).
The product of its (nonzero) digits is 280, while the sum is 18.
The square root of 4752000 is about 2179.9082549502. The cubic root of 4752000 is about 168.1223598393.
Adding to 4752000 its reverse (2574), we get a palindrome (4754574).
The spelling of 4752000 in words is "four million, seven hundred fifty-two thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •