Base | Representation |
---|---|
bin | 1011100100001… |
… | …1011010010000 |
3 | 10101021121001012 |
4 | 2321003122100 |
5 | 44404314413 |
6 | 4451430052 |
7 | 1126222226 |
oct | 271033220 |
9 | 111247035 |
10 | 48510608 |
11 | 25423813 |
12 | 142b5328 |
13 | a086503 |
14 | 662ab16 |
15 | 43d37a8 |
hex | 2e43690 |
48510608 has 20 divisors (see below), whose sum is σ = 95315328. Its totient is φ = 23913120.
The previous prime is 48510601. The next prime is 48510647. The reversal of 48510608 is 80601584.
It is a Smith number, since the sum of its digits (32) coincides with the sum of the digits of its prime factors.
It is not an unprimeable number, because it can be changed into a prime (48510601) 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 3 ways as a sum of consecutive naturals, for example, 20216 + ... + 22487.
Almost surely, 248510608 is an apocalyptic number.
It is an amenable number.
48510608 is a deficient number, since it is larger than the sum of its proper divisors (46804720).
48510608 is a wasteful number, since it uses less digits than its factorization.
48510608 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 42782 (or 42776 counting only the distinct ones).
The product of its (nonzero) digits is 7680, while the sum is 32.
The square root of 48510608 is about 6964.9557069661. The cubic root of 48510608 is about 364.7082374743.
The spelling of 48510608 in words is "forty-eight million, five hundred ten thousand, six hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •