Base | Representation |
---|---|
bin | 1111100111111… |
… | …10011111000000 |
3 | 100010121211110121 |
4 | 13303332133000 |
5 | 232023101132 |
6 | 21001110024 |
7 | 3151020004 |
oct | 763763700 |
9 | 303554417 |
10 | 131065792 |
11 | 67a8a740 |
12 | 37a88314 |
13 | 211cc930 |
14 | 1359a704 |
15 | b78e497 |
hex | 7cfe7c0 |
131065792 has 56 divisors (see below), whose sum is σ = 305574192. Its totient is φ = 54988800.
The previous prime is 131065789. The next prime is 131065793. The reversal of 131065792 is 297560131.
It is a zygodrome in base 2.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (131065793) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1992 + ... + 16312.
It is an arithmetic number, because the mean of its divisors is an integer number (5456682).
Almost surely, 2131065792 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 131065792, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (152787096).
131065792 is an abundant number, since it is smaller than the sum of its proper divisors (174508400).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
131065792 is a wasteful number, since it uses less digits than its factorization.
131065792 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14357 (or 14347 counting only the distinct ones).
The product of its (nonzero) digits is 11340, while the sum is 34.
The square root of 131065792 is about 11448.3969183463. The cubic root of 131065792 is about 507.9603168208.
The spelling of 131065792 in words is "one hundred thirty-one million, sixty-five thousand, seven hundred ninety-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •