Base | Representation |
---|---|
bin | 1011100101100… |
… | …0001110001000 |
3 | 10101102220222020 |
4 | 2321120032020 |
5 | 44420031343 |
6 | 4453324440 |
7 | 1130025600 |
oct | 271301610 |
9 | 111386866 |
10 | 48595848 |
11 | 25481864 |
12 | 14336720 |
13 | a0b6252 |
14 | 664dc00 |
15 | 43edb83 |
hex | 2e58388 |
48595848 has 144 divisors (see below), whose sum is σ = 149426640. Its totient is φ = 13124160.
The previous prime is 48595819. The next prime is 48595853. The reversal of 48595848 is 84859584.
Its product of digits (1843200) is a multiple of the sum of its prime factors (128).
It is a self number, because there is not a number n which added to its sum of digits gives 48595848.
It is an unprimeable number.
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 35 ways as a sum of consecutive naturals, for example, 1130115 + ... + 1130157.
It is an arithmetic number, because the mean of its divisors is an integer number (1037685).
Almost surely, 248595848 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 48595848, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (74713320).
48595848 is an abundant number, since it is smaller than the sum of its proper divisors (100830792).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
48595848 is a wasteful number, since it uses less digits than its factorization.
48595848 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 128 (or 86 counting only the distinct ones).
The product of its digits is 1843200, while the sum is 51.
The square root of 48595848 is about 6971.0722274267. The cubic root of 48595848 is about 364.9217271328.
The spelling of 48595848 in words is "forty-eight million, five hundred ninety-five thousand, eight hundred forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.002 sec. • engine limits •