Base | Representation |
---|---|
bin | 1011100100010… |
… | …1110110100100 |
3 | 10101022002202201 |
4 | 2321011312210 |
5 | 44410124422 |
6 | 4451544244 |
7 | 1126263340 |
oct | 271056644 |
9 | 111262681 |
10 | 48520612 |
11 | 25430288 |
12 | 142bb084 |
13 | a08ac2a |
14 | 6630620 |
15 | 43d6727 |
hex | 2e45da4 |
48520612 has 12 divisors (see below), whose sum is σ = 97041280. Its totient is φ = 20794536.
The previous prime is 48520609. The next prime is 48520613. The reversal of 48520612 is 21602584.
48520612 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
48520612 is an admirable number.
It is a Harshad number since it is a multiple of its sum of digits (28), and also a Moran number because the ratio is a prime number: 1732879 = 48520612 / (4 + 8 + 5 + 2 + 0 + 6 + 1 + 2).
It is not an unprimeable number, because it can be changed into a prime (48520613) by changing a digit.
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 3 ways as a sum of consecutive naturals, for example, 866412 + ... + 866467.
Almost surely, 248520612 is an apocalyptic number.
It is an amenable number.
48520612 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
48520612 is a wasteful number, since it uses less digits than its factorization.
48520612 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1732890 (or 1732888 counting only the distinct ones).
The product of its (nonzero) digits is 3840, while the sum is 28.
The square root of 48520612 is about 6965.6738367512. The cubic root of 48520612 is about 364.7333061523.
The spelling of 48520612 in words is "forty-eight million, five hundred twenty thousand, six hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •