Base | Representation |
---|---|
bin | 1101011101111… |
… | …0111101000110 |
3 | 10221021212121220 |
4 | 3113132331012 |
5 | 103430102000 |
6 | 5334421210 |
7 | 1254065214 |
oct | 327367506 |
9 | 127255556 |
10 | 56487750 |
11 | 299820a0 |
12 | 16b01806 |
13 | b91a407 |
14 | 7705cb4 |
15 | 4e5c1a0 |
hex | 35def46 |
56487750 has 128 divisors (see below), whose sum is σ = 158505984. Its totient is φ = 13280000.
The previous prime is 56487727. The next prime is 56487757. The reversal of 56487750 is 5778465.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (56487757) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 338167 + ... + 338333.
It is an arithmetic number, because the mean of its divisors is an integer number (1238328).
Almost surely, 256487750 is an apocalyptic number.
56487750 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 56487750, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (79252992).
56487750 is an abundant number, since it is smaller than the sum of its proper divisors (102018234).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
56487750 is a wasteful number, since it uses less digits than its factorization.
56487750 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 239 (or 229 counting only the distinct ones).
The product of its (nonzero) digits is 235200, while the sum is 42.
The square root of 56487750 is about 7515.8332871346. The cubic root of 56487750 is about 383.6937798502.
The spelling of 56487750 in words is "fifty-six million, four hundred eighty-seven thousand, seven hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •