Base | Representation |
---|---|
bin | 10111101101110011111111… |
… | …10000100000101001111100 |
3 | 20211122122111012111212022020 |
4 | 23312321333300200221330 |
5 | 23313423022400044012 |
6 | 302530044143120140 |
7 | 13661555110445142 |
oct | 1366717760405174 |
9 | 224578435455266 |
10 | 52151636331132 |
11 | 156874261338a8 |
12 | 5a234055a3050 |
13 | 2313b55550170 |
14 | cc421ccb9592 |
15 | 6068b51e5a8c |
hex | 2f6e7fc20a7c |
52151636331132 has 48 divisors (see below), whose sum is σ = 138756389883552. Its totient is φ = 15102736312320.
The previous prime is 52151636331131. The next prime is 52151636331233. The reversal of 52151636331132 is 23113363615125.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (52151636331131) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 9832507969 + ... + 9832513272.
It is an arithmetic number, because the mean of its divisors is an integer number (2890758122574).
Almost surely, 252151636331132 is an apocalyptic number.
52151636331132 is a gapful number since it is divisible by the number (52) formed by its first and last digit.
It is an amenable number.
52151636331132 is an abundant number, since it is smaller than the sum of its proper divisors (86604753552420).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
52151636331132 is a wasteful number, since it uses less digits than its factorization.
52151636331132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19665021278 (or 19665021276 counting only the distinct ones).
The product of its digits is 291600, while the sum is 42.
Adding to 52151636331132 its reverse (23113363615125), we get a palindrome (75264999946257).
The spelling of 52151636331132 in words is "fifty-two trillion, one hundred fifty-one billion, six hundred thirty-six million, three hundred thirty-one thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •