Base | Representation |
---|---|
bin | 1111101000101… |
… | …01001001101000 |
3 | 100010210112211010 |
4 | 13310111021220 |
5 | 232034034012 |
6 | 21003103520 |
7 | 3151554453 |
oct | 764251150 |
9 | 303715733 |
10 | 131158632 |
11 | 68043470 |
12 | 37b11ba0 |
13 | 21232c77 |
14 | 135c249a |
15 | b7abc3c |
hex | 7d15268 |
131158632 has 32 divisors (see below), whose sum is σ = 357706080. Its totient is φ = 39744960.
The previous prime is 131158609. The next prime is 131158637. The reversal of 131158632 is 236851131.
It is a super-2 number, since 2×1311586322 = 34405173496222848, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 131158632.
It is not an unprimeable number, because it can be changed into a prime (131158637) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 248143 + ... + 248670.
It is an arithmetic number, because the mean of its divisors is an integer number (11178315).
Almost surely, 2131158632 is an apocalyptic number.
131158632 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
131158632 is an abundant number, since it is smaller than the sum of its proper divisors (226547448).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
131158632 is a wasteful number, since it uses less digits than its factorization.
131158632 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 496833 (or 496829 counting only the distinct ones).
The product of its digits is 4320, while the sum is 30.
The square root of 131158632 is about 11452.4509167252. The cubic root of 131158632 is about 508.0802258235.
The spelling of 131158632 in words is "one hundred thirty-one million, one hundred fifty-eight thousand, six hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •