Base | Representation |
---|---|
bin | 1011100101100… |
… | …0011101000000 |
3 | 10101102222021111 |
4 | 2321120131000 |
5 | 44420044200 |
6 | 4453333104 |
7 | 1130031430 |
oct | 271303500 |
9 | 111388244 |
10 | 48596800 |
11 | 2548254a |
12 | 14337194 |
13 | a0b6805 |
14 | 66502c0 |
15 | 43ee0ba |
hex | 2e58740 |
48596800 has 84 divisors (see below), whose sum is σ = 136692640. Its totient is φ = 16657920.
The previous prime is 48596791. The next prime is 48596803. The reversal of 48596800 is 869584.
It is a Harshad number since it is a multiple of its sum of digits (40).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (48596803) 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 11 ways as a sum of consecutive naturals, for example, 9031 + ... + 13369.
Almost surely, 248596800 is an apocalyptic number.
48596800 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 48596800, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (68346320).
48596800 is an abundant number, since it is smaller than the sum of its proper divisors (88095840).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
48596800 is a wasteful number, since it uses less digits than its factorization.
48596800 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4368 (or 4353 counting only the distinct ones).
The product of its (nonzero) digits is 69120, while the sum is 40.
The square root of 48596800 is about 6971.1405092711. The cubic root of 48596800 is about 364.9241100745.
The spelling of 48596800 in words is "forty-eight million, five hundred ninety-six thousand, eight hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •