Base | Representation |
---|---|
bin | 1111101111100… |
… | …01100111000000 |
3 | 100012111102111120 |
4 | 13313301213000 |
5 | 232301433012 |
6 | 21034312240 |
7 | 3162335223 |
oct | 767614700 |
9 | 305442446 |
10 | 132061632 |
11 | 685aa94a |
12 | 38288680 |
13 | 2148aca1 |
14 | 137795ba |
15 | b8d958c |
hex | 7df19c0 |
132061632 has 56 divisors (see below), whose sum is σ = 353665536. Its totient is φ = 43484928.
The previous prime is 132061613. The next prime is 132061669. The reversal of 132061632 is 236160231.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (24).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 11793 + ... + 20079.
It is an arithmetic number, because the mean of its divisors is an integer number (6315456).
Almost surely, 2132061632 is an apocalyptic number.
132061632 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 132061632, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (176832768).
132061632 is an abundant number, since it is smaller than the sum of its proper divisors (221603904).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
132061632 is an equidigital number, since it uses as much as digits as its factorization.
132061632 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8385 (or 8375 counting only the distinct ones).
The product of its (nonzero) digits is 1296, while the sum is 24.
The square root of 132061632 is about 11491.8071685875. The cubic root of 132061632 is about 509.2435691217.
The spelling of 132061632 in words is "one hundred thirty-two million, sixty-one thousand, six hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •