Base | Representation |
---|---|
bin | 11101110101011000111010… |
… | …011011010011110101001001 |
3 | 122012120202200222202012110102 |
4 | 131311120322123103311021 |
5 | 114144240122132133231 |
6 | 1143022022234055145 |
7 | 36431525256253106 |
oct | 3565307233236511 |
9 | 565522628665412 |
10 | 131212231130441 |
11 | 3889888186068a |
12 | 1287198687a4b5 |
13 | 582a34cb6b386 |
14 | 24589c4cabaad |
15 | 10281e7e5cacb |
hex | 77563a6d3d49 |
131212231130441 has 8 divisors (see below), whose sum is σ = 141333791737344. Its totient is φ = 121458727272960.
The previous prime is 131212231130417. The next prime is 131212231130473. The reversal of 131212231130441 is 144031132212131.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 131212231130441 - 226 = 131212164021577 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (131212231130941) 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, 92014186616 + ... + 92014188041.
It is an arithmetic number, because the mean of its divisors is an integer number (17666723967168).
Almost surely, 2131212231130441 is an apocalyptic number.
It is an amenable number.
131212231130441 is a deficient number, since it is larger than the sum of its proper divisors (10121560606903).
131212231130441 is a wasteful number, since it uses less digits than its factorization.
131212231130441 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 184028374711.
The product of its (nonzero) digits is 3456, while the sum is 29.
Adding to 131212231130441 its reverse (144031132212131), we get a palindrome (275243363342572).
The spelling of 131212231130441 in words is "one hundred thirty-one trillion, two hundred twelve billion, two hundred thirty-one million, one hundred thirty thousand, four hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •