Base | Representation |
---|---|
bin | 1011011000110010101001… |
… | …1001111100000001010000 |
3 | 1122022221201001000100010212 |
4 | 2312030222121330001100 |
5 | 3120114032011012402 |
6 | 42343505052343252 |
7 | 2431402452314102 |
oct | 266145231740120 |
9 | 48287631010125 |
10 | 12520541110352 |
11 | 3a97a28057560 |
12 | 14a2693a74b28 |
13 | 6ca8b3362412 |
14 | 313dd6d01572 |
15 | 16aa4c058952 |
hex | b632a67c050 |
12520541110352 has 160 divisors (see below), whose sum is σ = 29952004449024. Its totient is φ = 4998530662400.
The previous prime is 12520541110349. The next prime is 12520541110397. The reversal of 12520541110352 is 25301114502521.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 602648 + ... + 5040264.
Almost surely, 212520541110352 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 12520541110352, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (14976002224512).
12520541110352 is an abundant number, since it is smaller than the sum of its proper divisors (17431463338672).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12520541110352 is a wasteful number, since it uses less digits than its factorization.
12520541110352 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4437717 (or 4437711 counting only the distinct ones).
The product of its (nonzero) digits is 12000, while the sum is 32.
Adding to 12520541110352 its reverse (25301114502521), we get a palindrome (37821655612873).
The spelling of 12520541110352 in words is "twelve trillion, five hundred twenty billion, five hundred forty-one million, one hundred ten thousand, three hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •