Base | Representation |
---|---|
bin | 1011100101101… |
… | …1010000101100 |
3 | 10101110120001102 |
4 | 2321123100230 |
5 | 44420431200 |
6 | 4453502232 |
7 | 1130110106 |
oct | 271332054 |
9 | 111416042 |
10 | 48608300 |
11 | 25490154 |
12 | 14341978 |
13 | a0bbb10 |
14 | 6654576 |
15 | 44026d5 |
hex | 2e5b42c |
48608300 has 72 divisors (see below), whose sum is σ = 114836400. Its totient is φ = 17752320.
The previous prime is 48608297. The next prime is 48608323. The reversal of 48608300 is 380684.
48608300 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 180566 + ... + 180834.
It is an arithmetic number, because the mean of its divisors is an integer number (1594950).
Almost surely, 248608300 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 48608300, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (57418200).
48608300 is an abundant number, since it is smaller than the sum of its proper divisors (66228100).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
48608300 is a wasteful number, since it uses less digits than its factorization.
48608300 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 435 (or 428 counting only the distinct ones).
The product of its (nonzero) digits is 4608, while the sum is 29.
The square root of 48608300 is about 6971.9652896439. The cubic root of 48608300 is about 364.9528931513.
Adding to 48608300 its reverse (380684), we get a palindrome (48988984).
The spelling of 48608300 in words is "forty-eight million, six hundred eight thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •