Base | Representation |
---|---|
bin | 1011100101001… |
… | …0000010111000 |
3 | 10101101122021100 |
4 | 2321102002320 |
5 | 44413224202 |
6 | 4453011400 |
7 | 1126562052 |
oct | 271220270 |
9 | 111348240 |
10 | 48570552 |
11 | 25464858 |
12 | 14323b60 |
13 | a0a7894 |
14 | 66448d2 |
15 | 43e641c |
hex | 2e520b8 |
48570552 has 96 divisors (see below), whose sum is σ = 138977280. Its totient is φ = 15301440.
The previous prime is 48570551. The next prime is 48570589. The reversal of 48570552 is 25507584.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (48570551) 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 23 ways as a sum of consecutive naturals, for example, 104673 + ... + 105135.
It is an arithmetic number, because the mean of its divisors is an integer number (1447680).
Almost surely, 248570552 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 48570552, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (69488640).
48570552 is an abundant number, since it is smaller than the sum of its proper divisors (90406728).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
48570552 is a wasteful number, since it uses less digits than its factorization.
48570552 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 553 (or 546 counting only the distinct ones).
The product of its (nonzero) digits is 56000, while the sum is 36.
The square root of 48570552 is about 6969.2576362192. The cubic root of 48570552 is about 364.8583975648.
The spelling of 48570552 in words is "forty-eight million, five hundred seventy thousand, five hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •