Base | Representation |
---|---|
bin | 11110000010111010110101… |
… | …100101110111010010110001 |
3 | 122022212122121220112110212012 |
4 | 132002322311211313102301 |
5 | 114310003314132240031 |
6 | 1145013111311212305 |
7 | 36555642130022621 |
oct | 3602726545672261 |
9 | 568778556473765 |
10 | 132142010430641 |
11 | 39117125a53482 |
12 | 129a200bb17095 |
13 | 5896c27068473 |
14 | 248b9c928c881 |
15 | 10424b4a1ab2b |
hex | 782eb59774b1 |
132142010430641 has 16 divisors (see below), whose sum is σ = 134312647210560. Its totient is φ = 129985187397120.
The previous prime is 132142010430607. The next prime is 132142010430673. The reversal of 132142010430641 is 146034010241231.
It is a cyclic number.
It is not a de Polignac number, because 132142010430641 - 226 = 132141943321777 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 132142010430598 and 132142010430607.
It is not an unprimeable number, because it can be changed into a prime (132142010430841) 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, 661506665 + ... + 661706393.
It is an arithmetic number, because the mean of its divisors is an integer number (8394540450660).
Almost surely, 2132142010430641 is an apocalyptic number.
It is an amenable number.
132142010430641 is a deficient number, since it is larger than the sum of its proper divisors (2170636779919).
132142010430641 is a wasteful number, since it uses less digits than its factorization.
132142010430641 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 234256.
The product of its (nonzero) digits is 13824, while the sum is 32.
Adding to 132142010430641 its reverse (146034010241231), we get a palindrome (278176020671872).
The spelling of 132142010430641 in words is "one hundred thirty-two trillion, one hundred forty-two billion, ten million, four hundred thirty thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •