Base | Representation |
---|---|
bin | 11110000001001001101101… |
… | …011101111010000100111011 |
3 | 122022110001002111221100102201 |
4 | 132001021231131322010323 |
5 | 114301011032033113201 |
6 | 1144441222134211031 |
7 | 36544112041324564 |
oct | 3601115535720473 |
9 | 568401074840381 |
10 | 132020541301051 |
11 | 3907a662883577 |
12 | 129825701b3a77 |
13 | 58886396aa060 |
14 | 2485b84b9b16b |
15 | 103e255ab7801 |
hex | 78126d77a13b |
132020541301051 has 8 divisors (see below), whose sum is σ = 142177121652384. Its totient is φ = 121864125820800.
The previous prime is 132020541301013. The next prime is 132020541301109. The reversal of 132020541301051 is 150103145020231.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 132020541301051 - 29 = 132020541300539 is a prime.
It is a super-3 number, since 3×1320205413010513 (a number of 43 digits) contains 333 as substring.
It is not an unprimeable number, because it can be changed into a prime (132020541302051) 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, 39552175 + ... + 42759976.
It is an arithmetic number, because the mean of its divisors is an integer number (17772140206548).
Almost surely, 2132020541301051 is an apocalyptic number.
132020541301051 is a deficient number, since it is larger than the sum of its proper divisors (10156580351333).
132020541301051 is a wasteful number, since it uses less digits than its factorization.
132020541301051 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 82435541.
The product of its (nonzero) digits is 3600, while the sum is 28.
Adding to 132020541301051 its reverse (150103145020231), we get a palindrome (282123686321282).
The spelling of 132020541301051 in words is "one hundred thirty-two trillion, twenty billion, five hundred forty-one million, three hundred one thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •