Base | Representation |
---|---|
bin | 1011100101000… |
… | …1100011110000 |
3 | 10101101112112120 |
4 | 2321101203300 |
5 | 44413143220 |
6 | 4452554240 |
7 | 1126553205 |
oct | 271214360 |
9 | 111345476 |
10 | 48568560 |
11 | 25463307 |
12 | 14322980 |
13 | a0a69c1 |
14 | 6643cac |
15 | 43e5a40 |
hex | 2e518f0 |
48568560 has 80 divisors (see below), whose sum is σ = 158501760. Its totient is φ = 12268800.
The previous prime is 48568519. The next prime is 48568567. The reversal of 48568560 is 6586584.
It is a tau number, because it is divible by the number of its divisors (80).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (48568567) 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, 766 + ... + 9885.
It is an arithmetic number, because the mean of its divisors is an integer number (1981272).
Almost surely, 248568560 is an apocalyptic number.
48568560 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 48568560, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (79250880).
48568560 is an abundant number, since it is smaller than the sum of its proper divisors (109933200).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
48568560 is a wasteful number, since it uses less digits than its factorization.
48568560 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10686 (or 10680 counting only the distinct ones).
The product of its (nonzero) digits is 230400, while the sum is 42.
The square root of 48568560 is about 6969.1147213975. The cubic root of 48568560 is about 364.8534095777.
The spelling of 48568560 in words is "forty-eight million, five hundred sixty-eight thousand, five hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.105 sec. • engine limits •