Base | Representation |
---|---|
bin | 1111101001001… |
… | …01011000000000 |
3 | 100010220220222110 |
4 | 13310211120000 |
5 | 232043200323 |
6 | 21004335320 |
7 | 3152252301 |
oct | 764453000 |
9 | 303826873 |
10 | 131225088 |
11 | 68089395 |
12 | 37b44540 |
13 | 212572a7 |
14 | 135dc7a8 |
15 | b7c1793 |
hex | 7d25600 |
131225088 has 80 divisors (see below), whose sum is σ = 359195760. Its totient is φ = 42541056.
The previous prime is 131225063. The next prime is 131225113. The reversal of 131225088 is 880522131.
It is an interprime number because it is at equal distance from previous prime (131225063) and next prime (131225113).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 55678 + ... + 57986.
It is an arithmetic number, because the mean of its divisors is an integer number (4489947).
Almost surely, 2131225088 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 131225088, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (179597880).
131225088 is an abundant number, since it is smaller than the sum of its proper divisors (227970672).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
131225088 is an equidigital number, since it uses as much as digits as its factorization.
131225088 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2367 (or 2351 counting only the distinct ones).
The product of its (nonzero) digits is 3840, while the sum is 30.
The square root of 131225088 is about 11455.3519369769. The cubic root of 131225088 is about 508.1660234002.
The spelling of 131225088 in words is "one hundred thirty-one million, two hundred twenty-five thousand, eighty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •