Base | Representation |
---|---|
bin | 1011100010100… |
… | …0010011110000 |
3 | 10101001221202210 |
4 | 2320220103300 |
5 | 44342241400 |
6 | 4445212120 |
7 | 1125250464 |
oct | 270502360 |
9 | 111057683 |
10 | 48399600 |
11 | 25358377 |
12 | 14261040 |
13 | a047b22 |
14 | 65dc4a4 |
15 | 43b0950 |
hex | 2e284f0 |
48399600 has 120 divisors (see below), whose sum is σ = 158172912. Its totient is φ = 12646400.
The previous prime is 48399599. The next prime is 48399607. The reversal of 48399600 is 699384.
It is a tau number, because it is divible by the number of its divisors (120).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (48399607) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 63220 + ... + 63980.
Almost surely, 248399600 is an apocalyptic number.
48399600 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 48399600, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (79086456).
48399600 is an abundant number, since it is smaller than the sum of its proper divisors (109773312).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
48399600 is a wasteful number, since it uses less digits than its factorization.
48399600 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 835 (or 824 counting only the distinct ones).
The product of its (nonzero) digits is 46656, while the sum is 39.
The square root of 48399600 is about 6956.9821043323. The cubic root of 48399600 is about 364.4298347747.
The spelling of 48399600 in words is "forty-eight million, three hundred ninety-nine thousand, six hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •