Base | Representation |
---|---|
bin | 10110001101110011110110… |
… | …11110110110110010011000 |
3 | 20101222022012122012120221210 |
4 | 23012321323132312302120 |
5 | 22400402001101223000 |
6 | 251522434431303120 |
7 | 13201341422006364 |
oct | 1306717336666230 |
9 | 211868178176853 |
10 | 48853029711000 |
11 | 146254a9748839 |
12 | 559006497aaa0 |
13 | 2134a89792ab8 |
14 | c0c6dbd4c2a4 |
15 | 59aba57cb350 |
hex | 2c6e7b7b6c98 |
48853029711000 has 256 divisors, whose sum is σ = 154589268787200. Its totient is φ = 12842241216000.
The previous prime is 48853029710963. The next prime is 48853029711019. The reversal of 48853029711000 is 11792035884.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 2521697314 + ... + 2521716686.
It is an arithmetic number, because the mean of its divisors is an integer number (603864331200).
Almost surely, 248853029711000 is an apocalyptic number.
48853029711000 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 48853029711000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (77294634393600).
48853029711000 is an abundant number, since it is smaller than the sum of its proper divisors (105736239076200).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
48853029711000 is a wasteful number, since it uses less digits than its factorization.
48853029711000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 31307 (or 31293 counting only the distinct ones).
The product of its (nonzero) digits is 483840, while the sum is 48.
The spelling of 48853029711000 in words is "forty-eight trillion, eight hundred fifty-three billion, twenty-nine million, seven hundred eleven thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •