Base | Representation |
---|---|
bin | 111101001101010010… |
… | …0101101001100011001 |
3 | 110120021102221022202212 |
4 | 1322122210231030121 |
5 | 4123143214114231 |
6 | 140214521204505 |
7 | 12332156251130 |
oct | 1723244551431 |
9 | 416242838685 |
10 | 131442332441 |
11 | 50820851912 |
12 | 21583930735 |
13 | c519955694 |
14 | 650cc7a917 |
15 | 36447bb42b |
hex | 1e9a92d319 |
131442332441 has 16 divisors (see below), whose sum is σ = 151044784128. Its totient is φ = 112046427600.
The previous prime is 131442332423. The next prime is 131442332507. The reversal of 131442332441 is 144233244131.
It is a cyclic number.
It is not a de Polignac number, because 131442332441 - 26 = 131442332377 is a prime.
It is a super-2 number, since 2×1314423324412 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 131442332398 and 131442332407.
It is not an unprimeable number, because it can be changed into a prime (131442337441) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 6502436 + ... + 6522618.
It is an arithmetic number, because the mean of its divisors is an integer number (9440299008).
Almost surely, 2131442332441 is an apocalyptic number.
It is an amenable number.
131442332441 is a deficient number, since it is larger than the sum of its proper divisors (19602451687).
131442332441 is a wasteful number, since it uses less digits than its factorization.
131442332441 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 25252.
The product of its digits is 27648, while the sum is 32.
Adding to 131442332441 its reverse (144233244131), we get a palindrome (275675576572).
The spelling of 131442332441 in words is "one hundred thirty-one billion, four hundred forty-two million, three hundred thirty-two thousand, four hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •