Base | Representation |
---|---|
bin | 1111110011010… |
… | …00110101000000 |
3 | 100020102020100111 |
4 | 13321220311000 |
5 | 232413044302 |
6 | 21053001104 |
7 | 3166441003 |
oct | 771506500 |
9 | 306366314 |
10 | 132549952 |
11 | 68903817 |
12 | 38483194 |
13 | 215cc332 |
14 | 1386553a |
15 | b9840d7 |
hex | 7e68d40 |
132549952 has 56 divisors (see below), whose sum is σ = 288173160. Its totient is φ = 60211200.
The previous prime is 132549941. The next prime is 132549959. The reversal of 132549952 is 259945231.
It can be written as a sum of positive squares in 4 ways, for example, as 10137856 + 122412096 = 3184^2 + 11064^2 .
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (132549959) 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, 29452 + ... + 33652.
Almost surely, 2132549952 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 132549952, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (144086580).
132549952 is an abundant number, since it is smaller than the sum of its proper divisors (155623208).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
132549952 is a wasteful number, since it uses less digits than its factorization.
132549952 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4259 (or 4249 counting only the distinct ones).
The product of its digits is 97200, while the sum is 40.
The square root of 132549952 is about 11513.0340049876. The cubic root of 132549952 is about 509.8704681931.
The spelling of 132549952 in words is "one hundred thirty-two million, five hundred forty-nine thousand, nine hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •