Base | Representation |
---|---|
bin | 1011100100111… |
… | …1111111101000 |
3 | 10101101012202020 |
4 | 2321033333220 |
5 | 44412442102 |
6 | 4452504440 |
7 | 1126525422 |
oct | 271177750 |
9 | 111335666 |
10 | 48562152 |
11 | 25459511 |
12 | 1431b120 |
13 | a0a3b02 |
14 | 6641812 |
15 | 43e3bbc |
hex | 2e4ffe8 |
48562152 has 32 divisors (see below), whose sum is σ = 122287200. Its totient is φ = 16069824.
The previous prime is 48562127. The next prime is 48562193. The reversal of 48562152 is 25126584.
It is a super-2 number, since 2×485621522 = 4716565213742208, which contains 22 as substring.
It is a plaindrome in base 9.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3943 + ... + 10614.
It is an arithmetic number, because the mean of its divisors is an integer number (3821475).
Almost surely, 248562152 is an apocalyptic number.
It is an amenable number.
48562152 is an abundant number, since it is smaller than the sum of its proper divisors (73725048).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
48562152 is a wasteful number, since it uses less digits than its factorization.
48562152 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14705 (or 14701 counting only the distinct ones).
The product of its digits is 19200, while the sum is 33.
The square root of 48562152 is about 6968.6549634775. The cubic root of 48562152 is about 364.8373629591.
The spelling of 48562152 in words is "forty-eight million, five hundred sixty-two thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •