Base | Representation |
---|---|
bin | 1110101111010110000111… |
… | …00000100111010001111000 |
3 | 11020202122212220022201100211 |
4 | 13113223003200213101320 |
5 | 13222024013422302412 |
6 | 152534212450040504 |
7 | 6553524626243023 |
oct | 727530340472170 |
9 | 136678786281324 |
10 | 32413103322232 |
11 | a3673578aa166 |
12 | 3775a62879134 |
13 | 1511708c1b359 |
14 | 800b343821ba |
15 | 3b3214c10ca7 |
hex | 1d7ac3827478 |
32413103322232 has 32 divisors (see below), whose sum is σ = 62870944500000. Its totient is φ = 15647530584448.
The previous prime is 32413103322181. The next prime is 32413103322233. The reversal of 32413103322232 is 23222330131423.
It is a junction number, because it is equal to n+sod(n) for n = 32413103322194 and 32413103322203.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (32413103322233) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 21436269 + ... + 22898467.
It is an arithmetic number, because the mean of its divisors is an integer number (1964717015625).
Almost surely, 232413103322232 is an apocalyptic number.
It is an amenable number.
32413103322232 is a deficient number, since it is larger than the sum of its proper divisors (30457841177768).
32413103322232 is a wasteful number, since it uses less digits than its factorization.
32413103322232 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1557783 (or 1557779 counting only the distinct ones).
The product of its (nonzero) digits is 31104, while the sum is 31.
Adding to 32413103322232 its reverse (23222330131423), we get a palindrome (55635433453655).
The spelling of 32413103322232 in words is "thirty-two trillion, four hundred thirteen billion, one hundred three million, three hundred twenty-two thousand, two hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •