Base | Representation |
---|---|
bin | 111101100111000010… |
… | …0111010100111010000 |
3 | 110122111122212012212202 |
4 | 1323032010322213100 |
5 | 4131430420222112 |
6 | 140440345342332 |
7 | 12362450651342 |
oct | 1731604724720 |
9 | 418448765782 |
10 | 132306414032 |
11 | 51124581131 |
12 | 217851979a8 |
13 | c626984270 |
14 | 6591927292 |
15 | 36955a06c2 |
hex | 1ece13a9d0 |
132306414032 has 80 divisors (see below), whose sum is σ = 288671523840. Its totient is φ = 58286570496.
The previous prime is 132306414001. The next prime is 132306414047. The reversal of 132306414032 is 230414603231.
It is a junction number, because it is equal to n+sod(n) for n = 132306413986 and 132306414004.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2262668 + ... + 2320404.
It is an arithmetic number, because the mean of its divisors is an integer number (3608394048).
Almost surely, 2132306414032 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 132306414032, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (144335761920).
132306414032 is an abundant number, since it is smaller than the sum of its proper divisors (156365109808).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
132306414032 is a wasteful number, since it uses less digits than its factorization.
132306414032 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 58260 (or 58254 counting only the distinct ones).
The product of its (nonzero) digits is 10368, while the sum is 29.
The spelling of 132306414032 in words is "one hundred thirty-two billion, three hundred six million, four hundred fourteen thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •