Base | Representation |
---|---|
bin | 1011100101100… |
… | …0000010101001 |
3 | 10101102212222000 |
4 | 2321120002221 |
5 | 44420020423 |
6 | 4453321213 |
7 | 1130023500 |
oct | 271300251 |
9 | 111385860 |
10 | 48595113 |
11 | 25481256 |
12 | 14336209 |
13 | a0b5b08 |
14 | 664d837 |
15 | 43ed843 |
hex | 2e580a9 |
48595113 has 48 divisors (see below), whose sum is σ = 87442560. Its totient is φ = 26544672.
The previous prime is 48595081. The next prime is 48595121. The reversal of 48595113 is 31159584.
It is not a de Polignac number, because 48595113 - 25 = 48595081 is a prime.
It is a super-2 number, since 2×485951132 = 4722970014965538, which contains 22 as substring.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (48595123) 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 47 ways as a sum of consecutive naturals, for example, 29631 + ... + 31227.
It is an arithmetic number, because the mean of its divisors is an integer number (1821720).
Almost surely, 248595113 is an apocalyptic number.
It is an amenable number.
48595113 is a deficient number, since it is larger than the sum of its proper divisors (38847447).
48595113 is a wasteful number, since it uses less digits than its factorization.
48595113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1643 (or 1630 counting only the distinct ones).
The product of its digits is 21600, while the sum is 36.
The square root of 48595113 is about 6971.0195093688. The cubic root of 48595113 is about 364.9198873404.
The spelling of 48595113 in words is "forty-eight million, five hundred ninety-five thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •