Base | Representation |
---|---|
bin | 1110100011010110100001… |
… | …11001101010001011111101 |
3 | 11012022021012111011101121102 |
4 | 13101223100321222023331 |
5 | 13143301032322144013 |
6 | 152021021144142445 |
7 | 6511665613355402 |
oct | 721532071521375 |
9 | 135267174141542 |
10 | 32001011131133 |
11 | a218609578700 |
12 | 370a015a67a25 |
13 | 14b18b430a165 |
14 | 7c8c002442a9 |
15 | 3a7646935d58 |
hex | 1d1ad0e6a2fd |
32001011131133 has 48 divisors (see below), whose sum is σ = 36219995804160. Its totient is φ = 28234967904000.
The previous prime is 32001011131087. The next prime is 32001011131151. The reversal of 32001011131133 is 33113111010023.
It is not a de Polignac number, because 32001011131133 - 236 = 31932291654397 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (32001011131183) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 910162208 + ... + 910197366.
It is an arithmetic number, because the mean of its divisors is an integer number (754583245920).
Almost surely, 232001011131133 is an apocalyptic number.
It is an amenable number.
32001011131133 is a deficient number, since it is larger than the sum of its proper divisors (4218984673027).
32001011131133 is a wasteful number, since it uses less digits than its factorization.
32001011131133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 36170 (or 36159 counting only the distinct ones).
The product of its (nonzero) digits is 162, while the sum is 20.
Adding to 32001011131133 its reverse (33113111010023), we get a palindrome (65114122141156).
The spelling of 32001011131133 in words is "thirty-two trillion, one billion, eleven million, one hundred thirty-one thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •