Base | Representation |
---|---|
bin | 1011101000000… |
… | …1110101110000 |
3 | 10101202120211000 |
4 | 2322001311300 |
5 | 44441010240 |
6 | 4501122000 |
7 | 1131335601 |
oct | 272016560 |
9 | 111676730 |
10 | 48766320 |
11 | 25588949 |
12 | 143b9300 |
13 | a145a15 |
14 | 6695da8 |
15 | 4434430 |
hex | 2e81d70 |
48766320 has 160 divisors (see below), whose sum is σ = 170346240. Its totient is φ = 12821760.
The previous prime is 48766303. The next prime is 48766321. The reversal of 48766320 is 2366784.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (48766321) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 231015 + ... + 231225.
It is an arithmetic number, because the mean of its divisors is an integer number (1064664).
Almost surely, 248766320 is an apocalyptic number.
48766320 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 48766320, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (85173120).
48766320 is an abundant number, since it is smaller than the sum of its proper divisors (121579920).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
48766320 is a wasteful number, since it uses less digits than its factorization.
48766320 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 340 (or 328 counting only the distinct ones).
The product of its (nonzero) digits is 48384, while the sum is 36.
The square root of 48766320 is about 6983.2886235641. The cubic root of 48766320 is about 365.3479386895.
The spelling of 48766320 in words is "forty-eight million, seven hundred sixty-six thousand, three hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •