Base | Representation |
---|---|
bin | 1011100010000… |
… | …0000011000000 |
3 | 10101000020100110 |
4 | 2320200003000 |
5 | 44340201020 |
6 | 4444351320 |
7 | 1125050022 |
oct | 270400300 |
9 | 111006313 |
10 | 48365760 |
11 | 25334a03 |
12 | 14245540 |
13 | a0355c1 |
14 | 65d0012 |
15 | 43a58e0 |
hex | 2e200c0 |
48365760 has 112 divisors (see below), whose sum is σ = 155667456. Its totient is φ = 12721152.
The previous prime is 48365747. The next prime is 48365761. The reversal of 48365760 is 6756384.
It is not an unprimeable number, because it can be changed into a prime (48365761) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (7) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 79377 + ... + 79983.
It is an arithmetic number, because the mean of its divisors is an integer number (1389888).
Almost surely, 248365760 is an apocalyptic number.
48365760 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 48365760, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (77833728).
48365760 is an abundant number, since it is smaller than the sum of its proper divisors (107301696).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
48365760 is a wasteful number, since it uses less digits than its factorization.
48365760 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 710 (or 700 counting only the distinct ones).
The product of its (nonzero) digits is 120960, while the sum is 39.
The square root of 48365760 is about 6954.5495900166. The cubic root of 48365760 is about 364.3448810362.
The spelling of 48365760 in words is "forty-eight million, three hundred sixty-five thousand, seven hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •