Base | Representation |
---|---|
bin | 1110100011111110000000… |
… | …00010010011001101100011 |
3 | 11012101021220101102220012010 |
4 | 13101333000002103031203 |
5 | 13144122432433121011 |
6 | 152034444052004003 |
7 | 6513346020426342 |
oct | 721770002231543 |
9 | 135337811386163 |
10 | 32022203020131 |
11 | a2265a3873555 |
12 | 371214b000603 |
13 | 14b38b08c944c |
14 | 7c9c50947b59 |
15 | 3a7e871391a6 |
hex | 1d1fc0093363 |
32022203020131 has 16 divisors (see below), whose sum is σ = 44405423744000. Its totient is φ = 20509836469920.
The previous prime is 32022203020079. The next prime is 32022203020141. The reversal of 32022203020131 is 13102030222023.
It is a happy number.
It is not a de Polignac number, because 32022203020131 - 221 = 32022200922979 is a prime.
It is a super-2 number, since 2×320222030201312 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 32022203020098 and 32022203020107.
It is not an unprimeable number, because it can be changed into a prime (32022203020141) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2034698131 + ... + 2034713868.
It is an arithmetic number, because the mean of its divisors is an integer number (2775338984000).
Almost surely, 232022203020131 is an apocalyptic number.
32022203020131 is a deficient number, since it is larger than the sum of its proper divisors (12383220723869).
32022203020131 is a wasteful number, since it uses less digits than its factorization.
32022203020131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4069412106.
The product of its (nonzero) digits is 864, while the sum is 21.
Adding to 32022203020131 its reverse (13102030222023), we get a palindrome (45124233242154).
The spelling of 32022203020131 in words is "thirty-two trillion, twenty-two billion, two hundred three million, twenty thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •