Base | Representation |
---|---|
bin | 1011100110010… |
… | …0001000101100 |
3 | 10101112101220210 |
4 | 2321210020230 |
5 | 44423112102 |
6 | 4454342420 |
7 | 1130321100 |
oct | 271441054 |
9 | 111471823 |
10 | 48644652 |
11 | 255054a1 |
12 | 1435aa10 |
13 | a102524 |
14 | 6663900 |
15 | 440d36c |
hex | 2e6422c |
48644652 has 36 divisors (see below), whose sum is σ = 132037080. Its totient is φ = 13898304.
The previous prime is 48644647. The next prime is 48644657. The reversal of 48644652 is 25644684.
It is an interprime number because it is at equal distance from previous prime (48644647) and next prime (48644657).
It is a super-2 number, since 2×486446522 = 4732604336402208, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 48644652.
It is not an unprimeable number, because it can be changed into a prime (48644657) 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 11 ways as a sum of consecutive naturals, for example, 40777 + ... + 41952.
Almost surely, 248644652 is an apocalyptic number.
48644652 is a gapful number since it is divisible by the number (42) formed by its first and last digit.
It is an amenable number.
48644652 is an abundant number, since it is smaller than the sum of its proper divisors (83392428).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
48644652 is a wasteful number, since it uses less digits than its factorization.
48644652 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 82750 (or 82741 counting only the distinct ones).
The product of its digits is 184320, while the sum is 39.
The square root of 48644652 is about 6974.5718148142. The cubic root of 48644652 is about 365.0438478630.
The spelling of 48644652 in words is "forty-eight million, six hundred forty-four thousand, six hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •