Base | Representation |
---|---|
bin | 1011101000000… |
… | …0010110001000 |
3 | 10101202021102100 |
4 | 2322000112020 |
5 | 44440311300 |
6 | 4501033400 |
7 | 1131312006 |
oct | 272002610 |
9 | 111667370 |
10 | 48760200 |
11 | 25584295 |
12 | 143b5860 |
13 | a142cb8 |
14 | 6693a76 |
15 | 4432700 |
hex | 2e80588 |
48760200 has 144 divisors (see below), whose sum is σ = 165971520. Its totient is φ = 12827520.
The previous prime is 48760189. The next prime is 48760211. The reversal of 48760200 is 206784.
It is an interprime number because it is at equal distance from previous prime (48760189) and next prime (48760211).
It is an unprimeable number.
It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 185269 + ... + 185531.
It is an arithmetic number, because the mean of its divisors is an integer number (1152580).
Almost surely, 248760200 is an apocalyptic number.
48760200 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 48760200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (82985760).
48760200 is an abundant number, since it is smaller than the sum of its proper divisors (117211320).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
48760200 is a wasteful number, since it uses less digits than its factorization.
48760200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 388 (or 376 counting only the distinct ones).
The product of its (nonzero) digits is 2688, while the sum is 27.
The square root of 48760200 is about 6982.8504208525. The cubic root of 48760200 is about 365.3326547604.
Adding to 48760200 its reverse (206784), we get a palindrome (48966984).
The spelling of 48760200 in words is "forty-eight million, seven hundred sixty thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •