Base | Representation |
---|---|
bin | 10111101100110000010110… |
… | …10000110110101111010000 |
3 | 20211112011202101221200200122 |
4 | 23312120023100312233100 |
5 | 23312324134431400202 |
6 | 302501240512005412 |
7 | 13656131160054512 |
oct | 1366301320665720 |
9 | 224464671850618 |
10 | 52115322137552 |
11 | 15672a90780773 |
12 | 5a1836bb30868 |
13 | 23105b8c91c5b |
14 | cc2576035bb2 |
15 | 60598c0be9a2 |
hex | 2f660b436bd0 |
52115322137552 has 20 divisors (see below), whose sum is σ = 104230644276096. Its totient is φ = 25217091356640.
The previous prime is 52115322137491. The next prime is 52115322137563. The reversal of 52115322137552 is 25573122351125.
52115322137552 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
52115322137552 is an admirable number.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 52535606498 + ... + 52535607489.
Almost surely, 252115322137552 is an apocalyptic number.
It is an amenable number.
52115322137552 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
52115322137552 is a wasteful number, since it uses less digits than its factorization.
52115322137552 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 105071214026 (or 105071214020 counting only the distinct ones).
The product of its digits is 630000, while the sum is 44.
Adding to 52115322137552 its reverse (25573122351125), we get a palindrome (77688444488677).
The spelling of 52115322137552 in words is "fifty-two trillion, one hundred fifteen billion, three hundred twenty-two million, one hundred thirty-seven thousand, five hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •