Base | Representation |
---|---|
bin | 1011100111111… |
… | …0011111011000 |
3 | 10101201212222212 |
4 | 2321332133120 |
5 | 44440040400 |
6 | 4500534252 |
7 | 1131250601 |
oct | 271763730 |
9 | 111655885 |
10 | 48752600 |
11 | 25579606 |
12 | 143b1388 |
13 | a13c6c0 |
14 | 6690da8 |
15 | 4430335 |
hex | 2e7e7d8 |
48752600 has 96 divisors (see below), whose sum is σ = 129366720. Its totient is φ = 16926720.
The previous prime is 48752581. The next prime is 48752609. The reversal of 48752600 is 625784.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (48752609) 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 23 ways as a sum of consecutive naturals, for example, 43649 + ... + 44751.
It is an arithmetic number, because the mean of its divisors is an integer number (1347570).
Almost surely, 248752600 is an apocalyptic number.
48752600 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 48752600, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (64683360).
48752600 is an abundant number, since it is smaller than the sum of its proper divisors (80614120).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
48752600 is a wasteful number, since it uses less digits than its factorization.
48752600 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1149 (or 1140 counting only the distinct ones).
The product of its (nonzero) digits is 13440, while the sum is 32.
The square root of 48752600 is about 6982.3062092693. The cubic root of 48752600 is about 365.3136729375.
The spelling of 48752600 in words is "forty-eight million, seven hundred fifty-two thousand, six hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •