Base | Representation |
---|---|
bin | 1111110010010… |
… | …10111100001010 |
3 | 100020012000102100 |
4 | 13321022330022 |
5 | 232400140110 |
6 | 21050214230 |
7 | 3165421044 |
oct | 771127412 |
9 | 306160370 |
10 | 132427530 |
11 | 6882a844 |
12 | 38424376 |
13 | 215886b1 |
14 | 13832a94 |
15 | b95cbc0 |
hex | 7e4af0a |
132427530 has 96 divisors (see below), whose sum is σ = 371067840. Its totient is φ = 32659200.
The previous prime is 132427517. The next prime is 132427531. The reversal of 132427530 is 35724231.
It is a junction number, because it is equal to n+sod(n) for n = 132427494 and 132427503.
It is not an unprimeable number, because it can be changed into a prime (132427531) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 72630 + ... + 74430.
It is an arithmetic number, because the mean of its divisors is an integer number (3865290).
Almost surely, 2132427530 is an apocalyptic number.
132427530 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 132427530, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (185533920).
132427530 is an abundant number, since it is smaller than the sum of its proper divisors (238640310).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
132427530 is a wasteful number, since it uses less digits than its factorization.
132427530 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1876 (or 1873 counting only the distinct ones).
The product of its (nonzero) digits is 5040, while the sum is 27.
The square root of 132427530 is about 11507.7161070301. The cubic root of 132427530 is about 509.7134491774.
The spelling of 132427530 in words is "one hundred thirty-two million, four hundred twenty-seven thousand, five hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •