Base | Representation |
---|---|
bin | 10111101100110000101000… |
… | …01101011110111111100000 |
3 | 20211112012010212102010121111 |
4 | 23312120110031132333200 |
5 | 23312324441343430200 |
6 | 302501303433233104 |
7 | 13656134662016602 |
oct | 1366302415367740 |
9 | 224465125363544 |
10 | 52115472248800 |
11 | 15673058489554 |
12 | 5a183b2262794 |
13 | 23106110cc68c |
14 | cc258bd4d172 |
15 | 60599a3720ba |
hex | 2f661435efe0 |
52115472248800 has 36 divisors (see below), whose sum is σ = 127226896629336. Its totient is φ = 20846188899200.
The previous prime is 52115472248789. The next prime is 52115472248809. The reversal of 52115472248800 is 884227451125.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (52115472248809) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 32572169356 + ... + 32572170955.
It is an arithmetic number, because the mean of its divisors is an integer number (3534080461926).
Almost surely, 252115472248800 is an apocalyptic number.
52115472248800 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
It is an amenable number.
52115472248800 is an abundant number, since it is smaller than the sum of its proper divisors (75111424380536).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
52115472248800 is a wasteful number, since it uses less digits than its factorization.
52115472248800 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 65144340331 (or 65144340318 counting only the distinct ones).
The product of its (nonzero) digits is 1433600, while the sum is 49.
Adding to 52115472248800 its reverse (884227451125), we get a palindrome (52999699699925).
The spelling of 52115472248800 in words is "fifty-two trillion, one hundred fifteen billion, four hundred seventy-two million, two hundred forty-eight thousand, eight hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •