Base | Representation |
---|---|
bin | 1111101011011… |
… | …10000011000000 |
3 | 100011111001022001 |
4 | 13311232003000 |
5 | 232132212002 |
6 | 21014553344 |
7 | 3154632154 |
oct | 765560300 |
9 | 304431261 |
10 | 131522752 |
11 | 68271a99 |
12 | 38068854 |
13 | 2132c91a |
14 | 13679064 |
15 | b82ea87 |
hex | 7d6e0c0 |
131522752 has 28 divisors (see below), whose sum is σ = 267361416. Its totient is φ = 64156160.
The previous prime is 131522749. The next prime is 131522759. The reversal of 131522752 is 257225131.
It is a Smith number, since the sum of its digits (28) coincides with the sum of the digits of its prime factors.
It is a self number, because there is not a number n which added to its sum of digits gives 131522752.
It is not an unprimeable number, because it can be changed into a prime (131522759) 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 3 ways as a sum of consecutive naturals, for example, 22438 + ... + 27685.
It is an arithmetic number, because the mean of its divisors is an integer number (9548622).
Almost surely, 2131522752 is an apocalyptic number.
It is an amenable number.
131522752 is an abundant number, since it is smaller than the sum of its proper divisors (135838664).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
131522752 is an equidigital number, since it uses as much as digits as its factorization.
131522752 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 50176 (or 50166 counting only the distinct ones).
The product of its digits is 4200, while the sum is 28.
The square root of 131522752 is about 11468.3369326158. The cubic root of 131522752 is about 508.5499654885.
Adding to 131522752 its reverse (257225131), we get a palindrome (388747883).
The spelling of 131522752 in words is "one hundred thirty-one million, five hundred twenty-two thousand, seven hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •