Base | Representation |
---|---|
bin | 101101100010110010… |
… | …110000001100000000 |
3 | 11200020001221200102100 |
4 | 231202302300030000 |
5 | 1300122420041000 |
6 | 34244301550400 |
7 | 3350561044050 |
oct | 554262601400 |
9 | 150201850370 |
10 | 48902112000 |
11 | 19814a705a5 |
12 | 9589275400 |
13 | 47c447b461 |
14 | 251c9c1560 |
15 | 14132c9a00 |
hex | b62cb0300 |
48902112000 has 864 divisors, whose sum is σ = 203746443264. Its totient is φ = 11031552000.
The previous prime is 48902111983. The next prime is 48902112019. The reversal of 48902112000 is 21120984.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 256031905 + ... + 256032095.
Almost surely, 248902112000 is an apocalyptic number.
48902112000 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 48902112000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (101873221632).
48902112000 is an abundant number, since it is smaller than the sum of its proper divisors (154844331264).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
48902112000 is a wasteful number, since it uses less digits than its factorization.
48902112000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 362 (or 335 counting only the distinct ones).
The product of its (nonzero) digits is 1152, while the sum is 27.
Adding to 48902112000 its reverse (21120984), we get a palindrome (48923232984).
The spelling of 48902112000 in words is "forty-eight billion, nine hundred two million, one hundred twelve thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •