Base | Representation |
---|---|
bin | 1011101011000… |
… | …1010100100000 |
3 | 10102010110120222 |
4 | 2322301110200 |
5 | 100013221200 |
6 | 4505222212 |
7 | 1133105600 |
oct | 272612440 |
9 | 112113528 |
10 | 48960800 |
11 | 25700a79 |
12 | 14491968 |
13 | a1b33b5 |
14 | 6706c00 |
15 | 4471d85 |
hex | 2eb1520 |
48960800 has 108 divisors (see below), whose sum is σ = 139151250. Its totient is φ = 16773120.
The previous prime is 48960781. The next prime is 48960827. The reversal of 48960800 is 806984.
It can be written as a sum of positive squares in 3 ways, for example, as 34245904 + 14714896 = 5852^2 + 3836^2 .
It is a Harshad number since it is a multiple of its sum of digits (35).
It is an unprimeable number.
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 17 ways as a sum of consecutive naturals, for example, 38576 + ... + 39824.
Almost surely, 248960800 is an apocalyptic number.
48960800 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 48960800, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (69575625).
48960800 is an abundant number, since it is smaller than the sum of its proper divisors (90190450).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
48960800 is a wasteful number, since it uses less digits than its factorization.
48960800 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1283 (or 1263 counting only the distinct ones).
The product of its (nonzero) digits is 13824, while the sum is 35.
The square root of 48960800 is about 6997.1994397759. The cubic root of 48960800 is about 365.8329634834.
The spelling of 48960800 in words is "forty-eight million, nine hundred sixty thousand, eight hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •