Base | Representation |
---|---|
bin | 1011100001010… |
… | …0001100010000 |
3 | 10100220202201221 |
4 | 2320110030100 |
5 | 44332122300 |
6 | 4443334424 |
7 | 1124455321 |
oct | 270241420 |
9 | 110822657 |
10 | 48317200 |
11 | 25301478 |
12 | 14221414 |
13 | a019479 |
14 | 65ba448 |
15 | 439631a |
hex | 2e14310 |
48317200 has 60 divisors (see below), whose sum is σ = 116857600. Its totient is φ = 19198080.
The previous prime is 48317183. The next prime is 48317201. The reversal of 48317200 is 271384.
It is a Harshad number since it is a multiple of its sum of digits (25).
It is not an unprimeable number, because it can be changed into a prime (48317201) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 79297 + ... + 79903.
Almost surely, 248317200 is an apocalyptic number.
48317200 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 48317200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (58428800).
48317200 is an abundant number, since it is smaller than the sum of its proper divisors (68540400).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
48317200 is a wasteful number, since it uses less digits than its factorization.
48317200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 824 (or 813 counting only the distinct ones).
The product of its (nonzero) digits is 1344, while the sum is 25.
The square root of 48317200 is about 6951.0574735072. The cubic root of 48317200 is about 364.2229041670. Note that the first 3 decimals are identical.
Adding to 48317200 its reverse (271384), we get a palindrome (48588584).
The spelling of 48317200 in words is "forty-eight million, three hundred seventeen thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •