Base | Representation |
---|---|
bin | 1011100111001… |
… | …1000000010000 |
3 | 10101122111110100 |
4 | 2321303000100 |
5 | 44432034202 |
6 | 4455532400 |
7 | 1130663460 |
oct | 271630020 |
9 | 111574410 |
10 | 48705552 |
11 | 25547225 |
12 | 1438a100 |
13 | a12416c |
14 | 667bba0 |
15 | 442141c |
hex | 2e73010 |
48705552 has 120 divisors (see below), whose sum is σ = 157202240. Its totient is φ = 13789440.
The previous prime is 48705551. The next prime is 48705563. The reversal of 48705552 is 25550784.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is not an unprimeable number, because it can be changed into a prime (48705551) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 212574 + ... + 212802.
Almost surely, 248705552 is an apocalyptic number.
48705552 is a gapful number since it is divisible by the number (42) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 48705552, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (78601120).
48705552 is an abundant number, since it is smaller than the sum of its proper divisors (108496688).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
48705552 is a wasteful number, since it uses less digits than its factorization.
48705552 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 461 (or 452 counting only the distinct ones).
The product of its (nonzero) digits is 56000, while the sum is 36.
The square root of 48705552 is about 6978.9363086362. The cubic root of 48705552 is about 365.1961215356.
It can be divided in two parts, 48 and 705552, that added together give a square (705600 = 8402).
The spelling of 48705552 in words is "forty-eight million, seven hundred five thousand, five hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •