Base | Representation |
---|---|
bin | 11110000001001001001101… |
… | …100001101110110011011101 |
3 | 122022102222201011121102000212 |
4 | 132001021031201232303131 |
5 | 114301003432342320131 |
6 | 1144441053032502205 |
7 | 36544062543450662 |
oct | 3601111541566335 |
9 | 568388634542025 |
10 | 132020005432541 |
11 | 3907a408348636 |
12 | 1298244084a965 |
13 | 5888582676ab5 |
14 | 2485b33949a69 |
15 | 103e223a16a2b |
hex | 78124d86ecdd |
132020005432541 has 16 divisors (see below), whose sum is σ = 135521619800448. Its totient is φ = 128531816582400.
The previous prime is 132020005432529. The next prime is 132020005432639. The reversal of 132020005432541 is 145234500020231.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-132020005432541 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 132020005432498 and 132020005432507.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (132020005332541) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 907087946 + ... + 907233476.
It is an arithmetic number, because the mean of its divisors is an integer number (8470101237528).
Almost surely, 2132020005432541 is an apocalyptic number.
It is an amenable number.
132020005432541 is a deficient number, since it is larger than the sum of its proper divisors (3501614367907).
132020005432541 is a wasteful number, since it uses less digits than its factorization.
132020005432541 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 191492.
The product of its (nonzero) digits is 28800, while the sum is 32.
Adding to 132020005432541 its reverse (145234500020231), we get a palindrome (277254505452772).
The spelling of 132020005432541 in words is "one hundred thirty-two trillion, twenty billion, five million, four hundred thirty-two thousand, five hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •