Base | Representation |
---|---|
bin | 1111110011010… |
… | …10001011101101 |
3 | 100020102111222000 |
4 | 13321222023231 |
5 | 232413234001 |
6 | 21053042513 |
7 | 3166463121 |
oct | 771521355 |
9 | 306374860 |
10 | 132555501 |
11 | 68907a01 |
12 | 38486439 |
13 | 21601a10 |
14 | 13867581 |
15 | b985a86 |
hex | 7e6a2ed |
132555501 has 64 divisors (see below), whose sum is σ = 221652480. Its totient is φ = 77760000.
The previous prime is 132555499. The next prime is 132555503. The reversal of 132555501 is 105555231.
It is an interprime number because it is at equal distance from previous prime (132555499) and next prime (132555503).
It is not a de Polignac number, because 132555501 - 21 = 132555499 is a prime.
It is a super-2 number, since 2×1325555012 = 35141921690722002, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (132555503) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 877776 + ... + 877926.
It is an arithmetic number, because the mean of its divisors is an integer number (3463320).
Almost surely, 2132555501 is an apocalyptic number.
It is an amenable number.
132555501 is a deficient number, since it is larger than the sum of its proper divisors (89096979).
132555501 is a wasteful number, since it uses less digits than its factorization.
132555501 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 275 (or 269 counting only the distinct ones).
The product of its (nonzero) digits is 3750, while the sum is 27.
The square root of 132555501 is about 11513.2749902015. The cubic root of 132555501 is about 509.8775830750.
The spelling of 132555501 in words is "one hundred thirty-two million, five hundred fifty-five thousand, five hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •