Base | Representation |
---|---|
bin | 11101110010111101011001… |
… | …101001110110011011111000 |
3 | 122011222210200212202111200101 |
4 | 131302331121221312123320 |
5 | 114134021133313430402 |
6 | 1142413205105045144 |
7 | 36413464330232110 |
oct | 3562753151663370 |
9 | 564883625674611 |
10 | 131045251311352 |
11 | 38833a850280a4 |
12 | 128455456267b4 |
13 | 581768b8433b1 |
14 | 24508a43b2040 |
15 | 1023bc3840b87 |
hex | 772f59a766f8 |
131045251311352 has 32 divisors (see below), whose sum is σ = 282831477667200. Its totient is φ = 55758205590624.
The previous prime is 131045251311281. The next prime is 131045251311361. The reversal of 131045251311352 is 253113152540131.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 8417595718 + ... + 8417611285.
It is an arithmetic number, because the mean of its divisors is an integer number (8838483677100).
Almost surely, 2131045251311352 is an apocalyptic number.
It is an amenable number.
131045251311352 is an abundant number, since it is smaller than the sum of its proper divisors (151786226355848).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
131045251311352 is a wasteful number, since it uses less digits than its factorization.
131045251311352 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16835207155 (or 16835207151 counting only the distinct ones).
The product of its (nonzero) digits is 54000, while the sum is 37.
The spelling of 131045251311352 in words is "one hundred thirty-one trillion, forty-five billion, two hundred fifty-one million, three hundred eleven thousand, three hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.166 sec. • engine limits •