Base | Representation |
---|---|
bin | 111101100011000101… |
… | …0000011111011000000 |
3 | 110122011101211210001010 |
4 | 1323012022003323000 |
5 | 4131142411421102 |
6 | 140415241440520 |
7 | 12356245411455 |
oct | 1730612037300 |
9 | 418141753033 |
10 | 132173545152 |
11 | 5106657a840 |
12 | 217487a0140 |
13 | c6052a2a1c |
14 | 657c01b82c |
15 | 3688aa6d6c |
hex | 1ec6283ec0 |
132173545152 has 224 divisors, whose sum is σ = 385624571904. Its totient is φ = 39621657600.
The previous prime is 132173545129. The next prime is 132173545187. The reversal of 132173545152 is 251545371231.
It is a self number, because there is not a number n which added to its sum of digits gives 132173545152.
It is an unprimeable number.
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 31 ways as a sum of consecutive naturals, for example, 153155473 + ... + 153156335.
Almost surely, 2132173545152 is an apocalyptic number.
132173545152 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 132173545152, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (192812285952).
132173545152 is an abundant number, since it is smaller than the sum of its proper divisors (253451026752).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
132173545152 is a wasteful number, since it uses less digits than its factorization.
132173545152 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1587 (or 1577 counting only the distinct ones).
The product of its digits is 126000, while the sum is 39.
The spelling of 132173545152 in words is "one hundred thirty-two billion, one hundred seventy-three million, five hundred forty-five thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •