Base | Representation |
---|---|
bin | 1111110000111… |
… | …01000101001000 |
3 | 100012211110202020 |
4 | 13320131011020 |
5 | 232323132223 |
6 | 21042204440 |
7 | 3164006310 |
oct | 770350510 |
9 | 305743666 |
10 | 132239688 |
11 | 687116a9 |
12 | 38353720 |
13 | 21521049 |
14 | 137c4440 |
15 | b9221e3 |
hex | 7e1d148 |
132239688 has 64 divisors (see below), whose sum is σ = 379192320. Its totient is φ = 37646400.
The previous prime is 132239633. The next prime is 132239689. The reversal of 132239688 is 886932231.
It is a Harshad number since it is a multiple of its sum of digits (42).
It is not an unprimeable number, because it can be changed into a prime (132239689) 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 15 ways as a sum of consecutive naturals, for example, 50983 + ... + 53513.
It is an arithmetic number, because the mean of its divisors is an integer number (5924880).
Almost surely, 2132239688 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 132239688, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (189596160).
132239688 is an abundant number, since it is smaller than the sum of its proper divisors (246952632).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
132239688 is a wasteful number, since it uses less digits than its factorization.
132239688 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2858 (or 2854 counting only the distinct ones).
The product of its digits is 124416, while the sum is 42.
The square root of 132239688 is about 11499.5516434338. The cubic root of 132239688 is about 509.4723339058.
The spelling of 132239688 in words is "one hundred thirty-two million, two hundred thirty-nine thousand, six hundred eighty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •