Base | Representation |
---|---|
bin | 1011100110100… |
… | …0101111110100 |
3 | 10101120100211100 |
4 | 2321220233310 |
5 | 44424213130 |
6 | 4455010100 |
7 | 1130430132 |
oct | 271505764 |
9 | 111510740 |
10 | 48663540 |
11 | 25518702 |
12 | 14369930 |
13 | a10acc3 |
14 | 666a752 |
15 | 4413c60 |
hex | 2e68bf4 |
48663540 has 72 divisors (see below), whose sum is σ = 150427368. Its totient is φ = 12729600.
The previous prime is 48663533. The next prime is 48663551. The reversal of 48663540 is 4536684.
It can be written as a sum of positive squares in 4 ways, for example, as 138384 + 48525156 = 372^2 + 6966^2 .
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a junction number, because it is equal to n+sod(n) for n = 48663495 and 48663504.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 6990 + ... + 12090.
It is an arithmetic number, because the mean of its divisors is an integer number (2089269).
Almost surely, 248663540 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 48663540, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (75213684).
48663540 is an abundant number, since it is smaller than the sum of its proper divisors (101763828).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
48663540 is a wasteful number, since it uses less digits than its factorization.
48663540 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5169 (or 5164 counting only the distinct ones).
The product of its (nonzero) digits is 69120, while the sum is 36.
The square root of 48663540 is about 6975.9257450176. The cubic root of 48663540 is about 365.0910887943.
The spelling of 48663540 in words is "forty-eight million, six hundred sixty-three thousand, five hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •