Base | Representation |
---|---|
bin | 1011100101001… |
… | …1100010000000 |
3 | 10101101221121211 |
4 | 2321103202000 |
5 | 44413423030 |
6 | 4453055504 |
7 | 1126615600 |
oct | 271234200 |
9 | 111357554 |
10 | 48576640 |
11 | 25469392 |
12 | 14327594 |
13 | a0aa598 |
14 | 6646c00 |
15 | 43e812a |
hex | 2e53880 |
48576640 has 96 divisors (see below), whose sum is σ = 135175500. Its totient is φ = 16644096.
The previous prime is 48576637. The next prime is 48576691. The reversal of 48576640 is 4667584.
It can be written as a sum of positive squares in 2 ways, for example, as 47444544 + 1132096 = 6888^2 + 1064^2 .
It is a Harshad number since it is a multiple of its sum of digits (40).
It is a junction number, because it is equal to n+sod(n) for n = 48576593 and 48576602.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 30586 + ... + 32134.
Almost surely, 248576640 is an apocalyptic number.
48576640 is a gapful number since it is divisible by the number (40) 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 48576640, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (67587750).
48576640 is an abundant number, since it is smaller than the sum of its proper divisors (86598860).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
48576640 is a wasteful number, since it uses less digits than its factorization.
48576640 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1582 (or 1563 counting only the distinct ones).
The product of its (nonzero) digits is 161280, while the sum is 40.
The square root of 48576640 is about 6969.6943978915. The cubic root of 48576640 is about 364.8736411300.
The spelling of 48576640 in words is "forty-eight million, five hundred seventy-six thousand, six hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •