Base | Representation |
---|---|
bin | 1111101111100… |
… | …11001101000000 |
3 | 100012111202110100 |
4 | 13313303031000 |
5 | 232302140120 |
6 | 21034402400 |
7 | 3162363240 |
oct | 767631500 |
9 | 305452410 |
10 | 132068160 |
11 | 68604844 |
12 | 38290400 |
13 | 21490c53 |
14 | 1377bb20 |
15 | b8db490 |
hex | 7df3340 |
132068160 has 168 divisors, whose sum is σ = 519232896. Its totient is φ = 30182400.
The previous prime is 132068143. The next prime is 132068161. The reversal of 132068160 is 61860231.
It is a tau number, because it is divible by the number of its divisors (168).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (132068161) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 16885 + ... + 23435.
It is an arithmetic number, because the mean of its divisors is an integer number (3090672).
Almost surely, 2132068160 is an apocalyptic number.
132068160 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 132068160, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (259616448).
132068160 is an abundant number, since it is smaller than the sum of its proper divisors (387164736).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
132068160 is a wasteful number, since it uses less digits than its factorization.
132068160 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6581 (or 6568 counting only the distinct ones).
The product of its (nonzero) digits is 1728, while the sum is 27.
The square root of 132068160 is about 11492.0911935122. The cubic root of 132068160 is about 509.2519598688.
The spelling of 132068160 in words is "one hundred thirty-two million, sixty-eight thousand, one hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •