Base | Representation |
---|---|
bin | 1111101111111… |
… | …00001011111000 |
3 | 100012120121221000 |
4 | 13313330023320 |
5 | 232304324302 |
6 | 21035245000 |
7 | 3162605430 |
oct | 767741370 |
9 | 305517830 |
10 | 132104952 |
11 | 6862a451 |
12 | 382a9760 |
13 | 214a4915 |
14 | 1378b2c0 |
15 | b8e731c |
hex | 7dfc2f8 |
132104952 has 128 divisors (see below), whose sum is σ = 429811200. Its totient is φ = 36806400.
The previous prime is 132104941. The next prime is 132104969. The reversal of 132104952 is 259401231.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 60927 + ... + 63057.
It is an arithmetic number, because the mean of its divisors is an integer number (3357900).
Almost surely, 2132104952 is an apocalyptic number.
132104952 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 132104952, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (214905600).
132104952 is an abundant number, since it is smaller than the sum of its proper divisors (297706248).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
132104952 is a wasteful number, since it uses less digits than its factorization.
132104952 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2194 (or 2184 counting only the distinct ones).
The product of its (nonzero) digits is 2160, while the sum is 27.
The square root of 132104952 is about 11493.6918350894. The cubic root of 132104952 is about 509.2992451960.
The spelling of 132104952 in words is "one hundred thirty-two million, one hundred four thousand, nine hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •