Base | Representation |
---|---|
bin | 1111110101111… |
… | …10101100000000 |
3 | 100021002002202200 |
4 | 13322332230000 |
5 | 233010323012 |
6 | 21104313200 |
7 | 3202434213 |
oct | 772765400 |
9 | 307062680 |
10 | 132901632 |
11 | 69023a66 |
12 | 38612800 |
13 | 216c3426 |
14 | 1391777a |
15 | ba033dc |
hex | 7ebeb00 |
132901632 has 108 divisors (see below), whose sum is σ = 393797040. Its totient is φ = 43075584.
The previous prime is 132901627. The next prime is 132901633. The reversal of 132901632 is 236109231.
132901632 is a `hidden beast` number, since 1 + 3 + 29 + 0 + 1 + 632 = 666.
It is a junction number, because it is equal to n+sod(n) for n = 132901596 and 132901605.
It is not an unprimeable number, because it can be changed into a prime (132901633) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 84469 + ... + 86027.
Almost surely, 2132901632 is an apocalyptic number.
132901632 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 132901632, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (196898520).
132901632 is an abundant number, since it is smaller than the sum of its proper divisors (260895408).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
132901632 is a wasteful number, since it uses less digits than its factorization.
132901632 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1618 (or 1601 counting only the distinct ones).
The product of its (nonzero) digits is 1944, while the sum is 27.
The square root of 132901632 is about 11528.2970121350. The cubic root of 132901632 is about 510.3209974583.
The spelling of 132901632 in words is "one hundred thirty-two million, nine hundred one thousand, six hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •