Base | Representation |
---|---|
bin | 1110100111100001001000… |
… | …10010111111110101111011 |
3 | 11012210221122200021211011020 |
4 | 13103300210102333311323 |
5 | 13203122201404000011 |
6 | 152210452130433523 |
7 | 6525223600404402 |
oct | 723604422776573 |
9 | 135727580254136 |
10 | 32144144203131 |
11 | a273289452144 |
12 | 3731900a328a3 |
13 | 14c22450064bc |
14 | 7d1adb9d8639 |
15 | 3ab222735006 |
hex | 1d3c244bfd7b |
32144144203131 has 16 divisors (see below), whose sum is σ = 42869329384704. Its totient is φ = 21424194870624.
The previous prime is 32144144203091. The next prime is 32144144203181. The reversal of 32144144203131 is 13130244144123.
It is a happy number.
It is not a de Polignac number, because 32144144203131 - 211 = 32144144201083 is a prime.
It is a super-2 number, since 2×321441442031312 (a number of 28 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 32144144203092 and 32144144203101.
It is not an unprimeable number, because it can be changed into a prime (32144144203181) 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, 232932205 + ... + 233070161.
It is an arithmetic number, because the mean of its divisors is an integer number (2679333086544).
Almost surely, 232144144203131 is an apocalyptic number.
32144144203131 is a deficient number, since it is larger than the sum of its proper divisors (10725185181573).
32144144203131 is a wasteful number, since it uses less digits than its factorization.
32144144203131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 156370.
The product of its (nonzero) digits is 27648, while the sum is 33.
Adding to 32144144203131 its reverse (13130244144123), we get a palindrome (45274388347254).
The spelling of 32144144203131 in words is "thirty-two trillion, one hundred forty-four billion, one hundred forty-four million, two hundred three thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •