Base | Representation |
---|---|
bin | 1110100100010000001111… |
… | …11111101100001011110100 |
3 | 11012102020012011121201201210 |
4 | 13102020013333230023310 |
5 | 13144303014024331012 |
6 | 152043144152121420 |
7 | 6514143553353660 |
oct | 722100777541364 |
9 | 135366164551653 |
10 | 32032000230132 |
11 | a22a77106a421 |
12 | 3714024096270 |
13 | 14b47b2593726 |
14 | 7ca4ddb9d8a0 |
15 | 3a835c2db23c |
hex | 1d2207fec2f4 |
32032000230132 has 96 divisors (see below), whose sum is σ = 85515373891584. Its totient is φ = 9141641308800.
The previous prime is 32032000230077. The next prime is 32032000230133. The reversal of 32032000230132 is 23103200023023.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a junction number, because it is equal to n+sod(n) for n = 32032000230099 and 32032000230108.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (32032000230133) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 690158007 + ... + 690204417.
It is an arithmetic number, because the mean of its divisors is an integer number (890785144704).
Almost surely, 232032000230132 is an apocalyptic number.
It is an amenable number.
32032000230132 is an abundant number, since it is smaller than the sum of its proper divisors (53483373661452).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
32032000230132 is a wasteful number, since it uses less digits than its factorization.
32032000230132 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 55549 (or 55547 counting only the distinct ones).
The product of its (nonzero) digits is 1296, while the sum is 21.
Adding to 32032000230132 its reverse (23103200023023), we get a palindrome (55135200253155).
The spelling of 32032000230132 in words is "thirty-two trillion, thirty-two billion, two hundred thirty thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •