Base | Representation |
---|---|
bin | 1110100111001000111001… |
… | …00110111110010101011101 |
3 | 11012202201001201101001220220 |
4 | 13103210130212332111131 |
5 | 13202414023330221341 |
6 | 152200500522031553 |
7 | 6524253235255662 |
oct | 723443446762535 |
9 | 135681051331826 |
10 | 32131130320221 |
11 | a268810455309 |
12 | 372b28a6485b9 |
13 | 14c0c4cab377a |
14 | 7d1225497a69 |
15 | 3aac0ee8ea66 |
hex | 1d391c9be55d |
32131130320221 has 8 divisors (see below), whose sum is σ = 43753028521344. Its totient is φ = 20964992832960.
The previous prime is 32131130320169. The next prime is 32131130320229. The reversal of 32131130320221 is 12202303113123.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 32131130320221 - 211 = 32131130318173 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 32131130320191 and 32131130320200.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (32131130320229) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 113940178300 + ... + 113940178581.
It is an arithmetic number, because the mean of its divisors is an integer number (5469128565168).
Almost surely, 232131130320221 is an apocalyptic number.
It is an amenable number.
32131130320221 is a deficient number, since it is larger than the sum of its proper divisors (11621898201123).
32131130320221 is a wasteful number, since it uses less digits than its factorization.
32131130320221 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 227880356931.
The product of its (nonzero) digits is 1296, while the sum is 24.
Adding to 32131130320221 its reverse (12202303113123), we get a palindrome (44333433433344).
The spelling of 32131130320221 in words is "thirty-two trillion, one hundred thirty-one billion, one hundred thirty million, three hundred twenty thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •