Base | Representation |
---|---|
bin | 10111111110000000111000… |
… | …01010010011010000000000 |
3 | 20220121212100211100002120110 |
4 | 23333000130022103100000 |
5 | 23402033110121300343 |
6 | 304033510331511320 |
7 | 14050023041202000 |
oct | 1377003412232000 |
9 | 226555324302513 |
10 | 52708311118848 |
11 | 15881518584130 |
12 | 5ab32828b8540 |
13 | 23544ac259088 |
14 | d0314b0d2000 |
15 | 6160e6698833 |
hex | 2ff01c293400 |
52708311118848 has 1408 divisors, whose sum is σ = 195367514112000. Its totient is φ = 12468053606400.
The previous prime is 52708311118769. The next prime is 52708311118873. The reversal of 52708311118848 is 84881111380725.
It is a tau number, because it is divible by the number of its divisors (1408).
It is a super-2 number, since 2×527083111188482 (a number of 28 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 6108271398 + ... + 6108280026.
Almost surely, 252708311118848 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 52708311118848, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (97683757056000).
52708311118848 is an abundant number, since it is smaller than the sum of its proper divisors (142659202993152).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
52708311118848 is a wasteful number, since it uses less digits than its factorization.
52708311118848 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8732 (or 8700 counting only the distinct ones).
The product of its (nonzero) digits is 3440640, while the sum is 57.
The spelling of 52708311118848 in words is "fifty-two trillion, seven hundred eight billion, three hundred eleven million, one hundred eighteen thousand, eight hundred forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •