Base | Representation |
---|---|
bin | 11110001000010011111010… |
… | …011001111000011110011001 |
3 | 122101012002000012102202022122 |
4 | 132020103322121320132121 |
5 | 114332041131204330423 |
6 | 1145455230012431025 |
7 | 36624500035213616 |
oct | 3610237231703631 |
9 | 571162005382278 |
10 | 132512532105113 |
11 | 3924a281862576 |
12 | 12a41996a78475 |
13 | 58c2b55415124 |
14 | 24a18d840150d |
15 | 104be4d4d58c8 |
hex | 7884fa678799 |
132512532105113 has 8 divisors (see below), whose sum is σ = 137082478300680. Its totient is φ = 127942622478720.
The previous prime is 132512532105103. The next prime is 132512532105181. The reversal of 132512532105113 is 311501235215231.
It can be written as a sum of positive squares in 4 ways, for example, as 6088324307209 + 126424207797904 = 2467453^2 + 11243852^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-132512532105113 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (132512532105103) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1666478 + ... + 16364663.
It is an arithmetic number, because the mean of its divisors is an integer number (17135309787585).
Almost surely, 2132512532105113 is an apocalyptic number.
It is an amenable number.
132512532105113 is a deficient number, since it is larger than the sum of its proper divisors (4569946195567).
132512532105113 is a wasteful number, since it uses less digits than its factorization.
132512532105113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18284587.
The product of its (nonzero) digits is 27000, while the sum is 35.
The spelling of 132512532105113 in words is "one hundred thirty-two trillion, five hundred twelve billion, five hundred thirty-two million, one hundred five thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •