Base | Representation |
---|---|
bin | 101101010101111010… |
… | …010001111000010000 |
3 | 11122200000021002200220 |
4 | 231111322101320100 |
5 | 1244202102344300 |
6 | 34211021313040 |
7 | 3342325004103 |
oct | 552572217020 |
9 | 148600232626 |
10 | 48685981200 |
11 | 19713a702aa |
12 | 9528a05780 |
13 | 478b766bcc |
14 | 24dc00073a |
15 | 13ee335da0 |
hex | b55e91e10 |
48685981200 has 120 divisors (see below), whose sum is σ = 156069106176. Its totient is φ = 12973632000.
The previous prime is 48685981181. The next prime is 48685981217. The reversal of 48685981200 is 218958684.
It is a Cunningham number, because it is equal to 2206492-1.
It is a tau number, because it is divible by the number of its divisors (120).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 1751410 + ... + 1778990.
Almost surely, 248685981200 is an apocalyptic number.
48685981200 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 48685981200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (78034553088).
48685981200 is an abundant number, since it is smaller than the sum of its proper divisors (107383124976).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
48685981200 is a wasteful number, since it uses less digits than its factorization.
48685981200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 29073 (or 29062 counting only the distinct ones).
The product of its (nonzero) digits is 1105920, while the sum is 51.
The spelling of 48685981200 in words is "forty-eight billion, six hundred eighty-five million, nine hundred eighty-one thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •