Base | Representation |
---|---|
bin | 111101100001110110… |
… | …1010100010001100000 |
3 | 110122001112112012122220 |
4 | 1323003231110101200 |
5 | 4131101402034040 |
6 | 140411213031040 |
7 | 12355236224562 |
oct | 1730355242140 |
9 | 418045465586 |
10 | 132132455520 |
11 | 5104536556a |
12 | 21736a85480 |
13 | c5c9917230 |
14 | 65767a3332 |
15 | 368518c2d0 |
hex | 1ec3b54460 |
132132455520 has 96 divisors (see below), whose sum is σ = 448233966432. Its totient is φ = 32524910592.
The previous prime is 132132455513. The next prime is 132132455549. The reversal of 132132455520 is 25554231231.
It is a tau number, because it is divible by the number of its divisors (96).
It is a congruent number.
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 15 ways as a sum of consecutive naturals, for example, 10581297 + ... + 10593776.
It is an arithmetic number, because the mean of its divisors is an integer number (4669103817).
Almost surely, 2132132455520 is an apocalyptic number.
132132455520 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
132132455520 is an abundant number, since it is smaller than the sum of its proper divisors (316101510912).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
132132455520 is a wasteful number, since it uses less digits than its factorization.
132132455520 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21175104 (or 21175096 counting only the distinct ones).
The product of its (nonzero) digits is 36000, while the sum is 33.
Adding to 132132455520 its reverse (25554231231), we get a palindrome (157686686751).
The spelling of 132132455520 in words is "one hundred thirty-two billion, one hundred thirty-two million, four hundred fifty-five thousand, five hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •