Base | Representation |
---|---|
bin | 1110100110010001001101… |
… | …00110111011110100101101 |
3 | 11012122211220010212122100212 |
4 | 13103020212212323310231 |
5 | 13201421311211423041 |
6 | 152135034125232205 |
7 | 6522144326006600 |
oct | 723104646736455 |
9 | 135584803778325 |
10 | 32101233311021 |
11 | a257069365846 |
12 | 3725526102665 |
13 | 14bb196b6b594 |
14 | 7cd9ca9bc337 |
15 | 3aa06040b8eb |
hex | 1d32269bbd2d |
32101233311021 has 12 divisors (see below), whose sum is σ = 37672713399132. Its totient is φ = 27271844224128.
The previous prime is 32101233311011. The next prime is 32101233311051. The reversal of 32101233311021 is 12011333210123.
It can be written as a sum of positive squares in 2 ways, for example, as 550667884900 + 31550565426121 = 742070^2 + 5616989^2 .
It is a de Polignac number, because none of the positive numbers 2k-32101233311021 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (32101233311011) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 2898787430 + ... + 2898798503.
It is an arithmetic number, because the mean of its divisors is an integer number (3139392783261).
Almost surely, 232101233311021 is an apocalyptic number.
It is an amenable number.
32101233311021 is a deficient number, since it is larger than the sum of its proper divisors (5571480088111).
32101233311021 is a wasteful number, since it uses less digits than its factorization.
32101233311021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5797586060 (or 5797586053 counting only the distinct ones).
The product of its (nonzero) digits is 648, while the sum is 23.
Adding to 32101233311021 its reverse (12011333210123), we get a palindrome (44112566521144).
The spelling of 32101233311021 in words is "thirty-two trillion, one hundred one billion, two hundred thirty-three million, three hundred eleven thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •