Base | Representation |
---|---|
bin | 1111110110010… |
… | …11110101101100 |
3 | 100021011211122210 |
4 | 13323023311230 |
5 | 233014034000 |
6 | 21105410420 |
7 | 3203050236 |
oct | 773136554 |
9 | 307154583 |
10 | 132955500 |
11 | 69060487 |
12 | 38639a10 |
13 | 21711ac2 |
14 | 1392d256 |
15 | ba14350 |
hex | 7ecbd6c |
132955500 has 96 divisors (see below), whose sum is σ = 390394368. Its totient is φ = 35160000.
The previous prime is 132955481. The next prime is 132955507. The reversal of 132955500 is 5559231.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is not an unprimeable number, because it can be changed into a prime (132955507) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 226207 + ... + 226793.
It is an arithmetic number, because the mean of its divisors is an integer number (4066608).
Almost surely, 2132955500 is an apocalyptic number.
132955500 is a gapful number since it is divisible by the number (10) 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 132955500, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (195197184).
132955500 is an abundant number, since it is smaller than the sum of its proper divisors (257438868).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
132955500 is a wasteful number, since it uses less digits than its factorization.
132955500 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 760 (or 748 counting only the distinct ones).
The product of its (nonzero) digits is 6750, while the sum is 30.
The square root of 132955500 is about 11530.6331135805. The cubic root of 132955500 is about 510.3899363113.
The spelling of 132955500 in words is "one hundred thirty-two million, nine hundred fifty-five thousand, five hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •