Base | Representation |
---|---|
bin | 1110110111001011111000… |
… | …01010101001101010011101 |
3 | 11021201102012212121101221201 |
4 | 13123211330022221222131 |
5 | 13240432214231302031 |
6 | 153302043414555501 |
7 | 6612142360410661 |
oct | 733457412515235 |
9 | 137642185541851 |
10 | 32682489322141 |
11 | a46062521203a |
12 | 37ba103668b91 |
13 | 1530c3a3c6ab9 |
14 | 80dbab6ca8a1 |
15 | 3ba22e90ed61 |
hex | 1db97c2a9a9d |
32682489322141 has 4 divisors (see below), whose sum is σ = 32682596123772. Its totient is φ = 32682382520512.
The previous prime is 32682489322123. The next prime is 32682489322163. The reversal of 32682489322141 is 14122398428623.
It is a happy number.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 12148640540100 + 20533848782041 = 3485490^2 + 4531429^2 .
It is a cyclic number.
It is not a de Polignac number, because 32682489322141 - 27 = 32682489322013 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (32682489322121) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 52940476 + ... + 53554261.
It is an arithmetic number, because the mean of its divisors is an integer number (8170649030943).
Almost surely, 232682489322141 is an apocalyptic number.
It is an amenable number.
32682489322141 is a deficient number, since it is larger than the sum of its proper divisors (106801631).
32682489322141 is a wasteful number, since it uses less digits than its factorization.
32682489322141 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 106801630.
The product of its digits is 7962624, while the sum is 55.
The spelling of 32682489322141 in words is "thirty-two trillion, six hundred eighty-two billion, four hundred eighty-nine million, three hundred twenty-two thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.133 sec. • engine limits •